Volume 11 β’ Issue 2 β’ PP: 50-59 β’ 2024
The Dominator Coloring of Some Graph Classes
Open Access & Copyright
Β© 2024 The Author(s). Published by ASPG. This article is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
View PDF Abstract
A proper vertex coloring of a graph πΊ(π,πΈ) is an assignment of colors to the vertices of πΊ so that no two adjacent vertices have the same color. A dominator coloring of πΊ is a proper vertex coloring for which every vertex is adjacent to all the vertices of at least one color class. The minimum number of colors required to establish a proper dominator coloring on πΊ is called the dominator coloring number and is denoted by ππ(πΊ). In this paper, we determine the dominator coloring number of strong grid graphs ππβ ππ when π,π≥3. We also determine the dominator coloring number of the Queen graph π2,π for π≥2.
Keywords
References
[1] Bozoki S, Gal P, Marosi I, Weakley WD. Domination of the rectangular queen's graph. Electronic Journal of Combinatorics. 2019; 26(4): P4.45. DOI: https://doi.org/10.37236/6026.
[2] Chellali M, Maffray F. Dominator Colorings in Some Classes of Graphs. Graphs and Combinatorics. 2012; 28, 97-107. DOI: https: //doi.org/10.1007/s00373-010-1012-z.
[3] Gagnon A, Hassler A, Huang J, Krim-Yee A, Inerney FM, Zacarias AM, Seamone B, Virgile V. A method for eternally dominating strong grids. Discrete Mathematics and Theoretical Computer Science. 2020; 22(1): 1j+. DOI: https://doi.org/10.23638/DMTCS-22-1-8.
[4] Gera R, Horton S, Rasmussen C. Dominator colorings and safe clique partitions. Congr. Numer. 2006; 181, 19-32. Available from: https://core.ac.uk/reader/36718410.
[5] Gera R. On the Dominator Colorings in Bipartite Graphs. Fourth International Conference on Information Technology (ITNG'07), 2007; 947-952, DOI: 10.1109/ITNG.2007.142.
[6] Kalaivani R, Vijayalakshmi D. Dominator And Strong Dominator Chromatic Number of Product Graphs. International journal of Pure and Applied Mathematics. 2018; 119(4), 685-693. DOI:10.12732/ijpam.v119i4.10.
[7] KlavzΜar S, Tavakoli M. Dominated and dominator colorings over (edge) corona and hierarchical products. Applied Mathematics and Computation. 2021; 390, 125647. DOI: //doi.org/10.1016/j.amc.2020.125647.
[8] Merouane HB, Chellali M. On the dominator colorings in trees. Discussiones Mathematicae Graph Theory. 2012; 32(4). 677-683. Available from: http://eudml.org/doc/270842.
[9] Mohammed Adib A, Ramesh Rao T.R. Dominator coloring of Mycielskian graphs. Australasian Journal of Combinatorics. 2019; 73(2), 274-279. Available from: https: //ajc.maths.uq.edu.au/pdf/73/ajc_v73)p274.pdf.
Cite This Article
Choose your preferred format
Publisher's Note
The statements, opinions, and data presented in this article are solely those of the author(s) and do not necessarily represent those of ASPG, the journal, or its editors. ASPG and the editors disclaim responsibility for any harm arising from the use of any ideas, methods, instructions, or products described in this article, to the fullest extent permitted by applicable law.