Power dominator chromatic numbers of splitting graphs of certain classes of graphs.

Domination in graphs and coloring of graphs are two main areas of investigation in graph theory. Power domination is a variant of domination in graphs introduced in the study of the problem of monitoring an electric power system. Based on the notions of power domination and coloring of a graph, the concept of power dominator coloring of a graph was introduced. The minimum number of colors required for power dominator coloring of a graph G is called the power dominator chromatic number χpd(G) of G, which has been computed for some classes of graphs. Here we compute the power dominator chromatic number for splitting graphs of certain classes of graphs. [ABSTRACT FROM AUTHOR]