A graph has a dominator coloring if it has a proper coloring in which each vertex of the graph dominates every vertex of some color class. The dominator chromatic number is the minimum number of colors required for a dominator coloring of G. In this paper the dominator chromatic number for comb graph, jewel graph, flower graph is studied and also the dominator coloring of coronagraph of path with triangular snake graph and double triangular snake graph is studied.