A graph G is said to have a dominator coloring if it has a proper coloring in which every vertex of the graph dominates all vertices of atleast one color class. The dominator chromatic number Xd (G) ...