Open Access Open Access  Restricted Access Subscription or Fee Access

On Dominator Coloring in Circulant Graphs

A. Sangeetha Devi, Dr. M. M. Shanmugapriya

Abstract


The concept of dominator chromatic number was introduced by Gera et al. [4]. A dominator coloring of G is a proper coloring in which every vertex of G dominates every vertex of at least one color class. The  dominator chromatic number, is the minimum number of colors, which a dominator coloring of G requires.In this paper we found the dominator coloring of Circulant graph.

Keywords


Dominator Coloring, Dominator Chromatic Number, Circulant Graphs

Full Text:

PDF

References


. S. Arumugam, Jay Bagga and K. Raja Chandrasekar, On Dominator ColoringsinGraphs.Proc. Indian Acad. Sci. (Math.Sci.)Vol. 122,No. 4, November 2012, pp. 561–571.cIndian Academy of Sciences

. T. TamizhChelvam and I. Rani, Dominating sets in Cayley graphs on Zn, Tamkang Journal of Mathematics 37, No.4 (2007), 341-345.

. J. Lee, Independent perfect domination sets in Cayley graphs, J. Graph Theory, 37(4) (2001), 231-219.

. R. Gera, C. Rasmussen and S. Horton, Dominator colorings and safe clique partitions, CongressusNumerantium 181(2006), 19-32.

. T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Domination in Graphs – Advanced Topics, Marcel Dekker Inc., 1998.

. I.J. Dejter and O.Serra, Efficient dominating sets in Cayley graphs, DiscreteAppl.Math., 129(2003),319-328.




DOI: http://dx.doi.org/10.36039/AA082015002.

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.