Let G be finite, undirected, connected graph with vertex set V(G) and edge set E(G). A proper coloring of a graph G is a function from the set of vertices of a graph to a set of colors such that any two adjacent vertices have different colors. A dominator coloring of a graph G is a proper coloring of graph such that every vertex of V dominates all vertices of at least one color class(possible its own color class). In this article, we obtain dominator coloring of Jahangir graph, Kragujevac tree, Tadpole graph and Lollipop graph.
Dominator coloring, Jahangir graph, Kragujevavc tree, Tadpole graph, Lollipop graph
