On Equitable Dominator Coloring of Splitting Graphs from Specific Graph Classes

An equitable dominator coloring (EDC) of a graph G is a proper coloring of G where each vertex dominates every other vertex of at least one color class and the cardinalities of the color classes differ by a maximum of one. The equitable dominator chromatic number of G, which is represented by , is the minimum number of colors desired for a dominator coloring of G. In this paper, we calculate the dominator chromatic number of splitting graphs of specific graph classes.