Dominator Coloring Number of Some Class of Graphs
R.Rajeswari1, T.Manjula2, Krishna Deepika3, Anumita Dey4
1R.Rajeswari, Professor, Sathyabama Institute of Science & Technology, Deemed to be University, Chennai (Tamil Nadu), India.
2T.Manjula, Research Scholar, Department of Mathematics, Sathyabama Institute of Science & Technology, Deemed to be University, Chennai (Tamil Nadu), India.
3Krishna Deepika, Student, Department of ECE, Sathyabama Institute of Science & Technology, Deemed to be University, Chennai (Tamil Nadu), India.
4Anumita Dey, 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: 269-274 | Volume-8 Issue-2S, December 2018 | Retrieval Number: 100.1/ijeat.B10621282S18/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 node coloring of a graph where every node of the graph dominates all nodes 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 chromatic number denoted by χd (G). The dominator chromatic number and domination number of rose graph, triangular belt graph and alternate triangular belt graph is obtained and a relation between dominator chromatic number, domination number and chromatic number is expressed in this paper.
Keywords: Coloring, Domination, Dominator Coloring.
Scope of the Article: Graph Algorithms and Graph Drawing