DOMINATOR CHROMATIC NUMBER OF LEXICOGRAPHIC PRODUCT OF PATH WITH CERTAIN GRAPHS
A dominator coloring of a graph is a proper coloring in which every vertex is adjacent to at least one vertex from each color class. The minimum number of colors required to achieve a dominator coloring of is called the dominator chromatic number, denoted as In this paper, we obtain the dominator chromatic number of the lexicographic product of a path with certain graphs.
dominator chromatic number, lexicographic product, path, triple star, complete graph.
Received: June 29, 2024; Revised: February 5, 2025; Accepted: February 25, 2025; Published: March 10, 2025
How to cite this article: S. Megala, N. Mohanapriya, R. Karthika and R. Kalaivani, Dominator chromatic number of lexicographic product of path with certain graphs, Advances and Applications in Discrete Mathematics 42(4) (2025), 363-380.https://doi.org/10.17654/0974165825023
This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License
References:[1] R. M. Gera, On Dominator Coloring in Graphs, Graph Theory Notes, 2007, pp. 947-952.[2] M. Chellali and Maffray, Dominator colorings in some classes of graphs, Graphs Combinatorics 28 (2012), 97-107.[3] Lian Chen, Huiqin Jiang, Zehui Shao and Marija Ivanovic, Dominator and total dominator colorings in vague graphs, Eng. Appl. Sci. 2(2) (2019), 10-17.[4] R. Rajeswari, T. Manjula, Kriahna Deepika and Anumita Dey, Dominator coloring number of some class of graphs, International Journal of Engineering and Advanced Technology 8 (2018), 269-274.[5] T. Manjula and R. Rajeswari, Dominator coloring of Hajos and trampoline graph, International Conferences on Mathematical Sciences, Journal of Physics (2021), 1 8.[6] S. Karpagavalli and B. Kaviyarasi, Dominator chromatic number of central graph of some graphs, Advances and Applications in Mathematical Sciences 20 (2021), 1697-1707.[7] V. Jude Annie Cynthia, V. F. Fancy and K. Kavitha, Dominator coloring of certain graphs, International Journal of Advance Research 7 (2021), 2044-2049.[8] K. Kavitha and N. G. David, On strong dominator coloring of product of graphs, International Journal of Pure and Applied Mathematics 101(5) (2015), 605-613.[9] M. Venkatachalam, J. Vernold Vivin and K. Kaliraj, Harmonious coloring on double star graph families, Tamkang Journal of Mathematics 43(2) (2012), 153-158.[10] Akhlak Mansuri, Harmonious chromatic number of triple star graph, Journal of Hyperstructures 5(1) (2016), 26-32.[11] Muhammad Shahbaz Aasi, Muhammad Asif, Tanveer Iqbal and Muhammad Ibrahim, Radio labelings of lexicographic product of some graphs, Journal of Mathematics 2021 (2021), 1-6.[12] Wenhui Ma, Guanghua Dong, Yingyu Lu and Ning Wang, Lexicographic Product Graphs are antimagic: AKCE International Journal of Graphs Combinatorics (2017), 271-283.