Power Dominator Chromatic Number for some Special Graphs
A. Uma Maheswari1, Bala Samuvel J.2
1A. Uma Maheswari*, Associate Professor, PG & Research Department of Mathematics, Quaid-E-Millath Government College for Women (Autonomous), Chennai, Tamil Nadu, India.
2Bala Samuvel J, Research Scholar, PG & Research Department of Mathematics, Quaid-E-Millath Government College for Women (Autonomous), Chennai, Tamil Nadu, India.
Manuscript received on September 16, 2019. | Revised Manuscript received on 24 September, 2019. | Manuscript published on October 10, 2019. | PP: 3957-3960 | Volume-8 Issue-12, October 2019. | Retrieval Number: L34661081219/2019©BEIESP | DOI: 10.35940/ijitee.L3466.1081219
Open Access | Ethics and 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: Let G = (V, E) be a finite, connected, undirected with no loops, multiple edges graph. Then the power dominator coloring of G is a proper coloring of G, such that each vertex of G power dominates every vertex of some color class. The minimum number of color classes in a power dominator coloring of the graph, is the power dominator chromatic number . Here we study the power dominator chromatic number for some special graphs such as Bull Graph, Star Graph, Wheel Graph, Helm graph with the help of induction method and Fan Graph. Suitable examples are provided to exemplify the results.
Keywords: Bull Graph, Coloring, Power Dominator Coloring, Star Graph, Wheel Graph. AMS Mathematics Subject Classification (2010): 05C15, 05C69
Scope of the Article: Classification