On the Dominator Colorings in Bipartite Graphs
Ralucca Gera · 2007
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 numberXd(G) is the minimum number of color classes in a dominator coloring of a graph G. In this paper we study the dominator chromatic number for the hypercube, Qn= Qn-times K2(with Q1cong P2, n ges 2), and more generally for bipartite graphs. We then conclude it with open questions for further research