Dominator Coloring of Certain Graphs
T.Manjula1, R. Rajeswari2, Anumita Dey3, Krishna Deepika4
1T.Manjula, Research Scholar, Professor, Sathyabama Institute of Science & Technology, Deemed to be University, Chennai (Tamil Nadu), India.
2R.Rajeswari, Department of Mathematics, Sathyabama Institute of Science & Technology, Deemed to be University, Chennai (Tamil Nadu), India.
3Anumita Dey, Student, Department of ECE, Sathyabama Institute of Science & Technology, Deemed to be University, Chennai (Tamil Nadu), India.
4Krishna Deepika, Student, Department of ECE, Sathyabama Institute of Science & Technology, Deemed to be University, Chennai (Tamil Nadu), India.
Manuscript received on 13 December 2018 | Revised Manuscript received on 22 December 2018 | Manuscript Published on 30 December 2018 | PP: 262-268 | Volume-8 Issue-2S, December 2018 | Retrieval Number: 100.1/ijeat.B10611282S18/18©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: A proper vertex or node coloring of a graph where every vertex of the graph dominates all vertices of some color class is called the dominator coloring of the graph. The least number of colors used in the dominator coloring of a graph is called the dominator coloring number denoted by χd (G). The dominator chromatic number and domination number of closed sun graph, closed helm graph, generalized Flower snark, Double star snark and Watkins snark graph are derived and the relation between them are expressed in this paper.
Keywords: Coloring, Domination, Dominator Coloring.
Scope of the Article: Graph Algorithms and Graph Drawing