Dominator Coloring of Splitting Graph of Certain Graph

A 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 the minimum number of colors required for a dominator colouring of G is called the dominator chromatic number of G and it’s is denoted by xd(G) in this paper, we determine the dominator chromatic number of splitting graphs of complete graph, star graph, ladder rung graph, banana tree and sunlet graph