Equitable Dominator Coloring of Splitting Graph of Certain Graph

A equitable dominator colouring of a graph G is a proper coloring of G in which every vertex dominates every vertex of at least one colour class and the cardinalities of the color classes differ by at most one the minimum number of colors required for a dominator colouring of G is called the equitable dominator chromatic number of G and it's is denoted by, in this paper, we determine the dominator chromatic number of splitting graphs of some certain classes of graph.