Abstract
A dominator coloring (resp. total dominator coloring) of a graph G is a proper coloring of the vertices of G in which each closed neighborhood (resp. open neighborhood) of every vertex of G contains a color class. The dominator chromatic number (resp. total dominator chromatic number) of G is the minimum number of colors required for a dominator coloring (resp. total dominator coloring) of G. In this paper, we determine the dominator chromatic number and total dominator chromatic number of the circulant graph Cn (1, 2).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.