A hub set in a graph G is a set  such that any two vertices outside H are connected by a path whose all intermediate vertices lie in H. The minimum cardinality of a hub set is hub number of G. This paper obtains the hub number of Mycielskian of some standard graphs. At the same time, the corresponding minimum hub sets for Mycielskian of paths and cycles are also obtained. Moreover, the hubtic number and restrained hubtic number of Mycielskian of these standard graphs are found. A notable bound for Mycielskian graphs has been deduced and few relationships between hub parameters of Mycielskian graphs are provided.

hub number, hubtic number, restrained hub number, Mycielskian of a graph.

Received: April 6, 2023; Accepted: June 10, 2023; Published: June 30, 2023

How to cite this article: Veena Mathad, H. N. Sujatha and S. Puneeth, Hub parameters and Mycielskian of a graph, Advances and Applications in Discrete Mathematics 39(2) (2023), 221-236. http://dx.doi.org/10.17654/0974165823049

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:

[1] X.-G. Chen and H. Xing, Domination parameters in Mycielski graphs, Utilitas Mathematica 71 (2006), 235-244.
[2] D. C. Fisher, P. A. McKenna and E. D. Boyer, Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski’s graphs, Discrete Applied Mathematics 84 (1998), 93-105.
[3] F. Harary, Graph Theory, Addison Wesley, Reading Mass, 1969.
[4] T. W. Haynes and M. A. Henning, Total domination good vertices in graphs, Australasian Journal of Combinatorics 26 (2002), 305-315.
[5] F.-T. Hu, M. Y. Sohn and J. Lee, Bondage numbers of Mycielski graphs, Bulletin of the Malaysian Mathematical Sciences Society 39 (2016), 229-245.
[6] T. Kavaskar, Further results on the Mycielskian of graphs, International Workshop on Combinatorial Algorithms 7643 (2006), 73-75.
[7] S. I. Khalaf and V. Mathad, Restrained hub number in graphs, Bulletin of the International Mathematical Virtual Institute 9 (2019), 103-109.
[8] S. I. Khalaf and V. Mathad, On hubtic and restrained hubtic of a graph, TWMS Journal of Applied and Engineering Mathematics 9(4) (2019), 930-935.
[9] S. I. Khalaf and V. Mathad, Hub and global hub numbers of a graph, Proc. Jangjeon Math. Soc. 23(2) (2020), 231-239.
[10] S. I. Khalaf, V. Mathad and Sultan Senan Mahde, Hubtic number in graphs, Opuscula Mathematica 38(6) (2018), 841-847.
[11] W. Lin, J. Wu, P. C. B. Lam and G. Gu, Several parameters of generalized Mycielskians, Discret. Appl. Math. 154 (2006), 1173-1182.
[12] C. H. Lin, J. J. Liu, Y. L. Wang and W. C. K. Yen, The hub number of Sierpiński, Theory Comput. Syst. 49 (2011), 588-600.
[13] J. Mycielski, Sur le coloriage des graphs, Colloq. Math. 3 (1955), 161-162.
[14] V. Mathad, Neighbourhood connected neighbourhood number of graphs, International Journal of Mathematics Research 2 (2012), 193-199.
[15] V. Mathad, A. M. Sahal and S. Kiran, The total hub number of graphs, Bulletin of International Mathematical Virtual Institute 4 (2014), 61-67.
[16] M. Walsh, The hub number of a graph, International Journal of Mathematics and Computer Science 1 (2006), 117-124.