Power Dominator Equitable Coloring for some Standard Graphs

Abstract

A power dominator coloring of a graph is a proper coloring where each vertex in power dominates at least one complete color class. The power dominator chromatic number of is represented by . A graph is said to be equitably -colorable if it can be properly colored with colors such that the size of any two color classes of is differ by at most one, i.e, and represents an equitable chromatic number of . The power dominator equitable coloring of a graph is a proper - colorable if each vertex of power dominates each and every vertex of some color class for which . In this paper, we obtain the power dominator equitable chromatic number for some standard graphs.