Exploring Dominator Coloring In Splitting Graphs of Specific Types of Graphs

Every vertex in a graph G has its own color class or dominates every vertex of at least one color class, this is known as dominator coloring. χ d (G) is symbolized by the least color needed for a dominator coloring of G is the dominator chromatic number. These studies explored relation between domination and graph coloring. This study aims to discuss the dominator chromatic no., of splitting graphs - path, complete graph, star graph, ladder rung graph, banana tree and n-sunlet graph, Comb graph, twig graph, Complete bipartite graph, bistar graph, pan graph.