In this paper, we obtain the exact value of the radio k-chromatic number of a helm graph H_n and also those of the middle graph, central graph, line graph and jump graph of a helm graph.

radio k-coloring, radio k-chromatic number, Helm graph, middle graph, central graph, line graph, jump graph.

Received: June 2, 2024; Revised: August 9, 2024; Accepted: November 6, 2024; Published: November 25, 2024

How to cite this article: J. Kalaiselvi and D. Vijayalakshmi, On radio k-chromatic number of a helm graph, Advances and Applications in Discrete Mathematics 42(1) (2025), 79-88. https://doi.org/10.17654/0974165825006

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

References:
[1] Jorrold R. Griggs and Roer Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math. 5(4) (1992), 586-595.
[2] F. Harary, Graph Theory, Addison-Wesley, Reading MA, 1969.
[3] R. Kalfakakou, G. Nikolakopulou, E. Savvidou and M. Tsouros, Graph radio coloring concepts, Yugosl. J. Oper. Res. 13(2) (2003), 207 215.
[4] Gary Chartrand and Ping Zhang, Radio colorings of graphs - a survey, International Journal of Computational and Applied Mathematics 2(3) (2007), 237-252.
[5] Kalaiselvi Jaganathan, Vijayalakshmi Duraisamy, Mohanapriya Nagaraj and Aparna Venkitachalam, On radio coloring of bistar graph families, AIP Conf. Proc. 2718(1) (2023), 020011. doi:10.1063/5.0137300.
[6] D. Vijayalakshmi and K. Thilagavathi, b-coloring in the context of some graph operations, International Journal of Mathematical Archive 3(34) (2021), 1439-1442.
[7] N. Mohanapriya, Vivin J. Vernold and M. Venkatachalam, On dynamic coloring of fan graphs, Int. J. Pure Appl. Math. 106(8) (2016), 169-174.