Power Dominator Equitable Coloring of Graphs

The concept of power dominator equitable coloring is proposed in this paper as a novel graph coloring technique. A power dominator coloring of a graph G is a proper coloring in which each vertex power dominates every vertex of some color class. The power dominator equitable coloring is a proper k -coloring of G , in which every vertex of G power dominates all vertices of some color class C-1 , C-2 , C-3 , . .. or C k such that the difference in size between any two color classes is at most 1. The minimum number of colors in a power dominator equitable coloring set of vertices in a graph G is called the power dominator equitable chromatic number of G , denoted by chi pde ( G ). In this paper we have obtained chi pde for some special classes of graphs.