On the Dominator Colorings in Bipartite Graphs

  title={On the Dominator Colorings in Bipartite Graphs},
  author={Ralucca Gera},
  journal={Fourth International Conference on Information Technology (ITNG'07)},
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 <sub>Xd</sub>(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, Q<sub>n </sub> = Q<sub>n-</sub> times K<sub>2</sub> (with Q<sub>1</sub> cong P<sub>2</sub>, n ges 2), and more generally for bipartite graphs. We then conclude it… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
9 Citations
7 References
Similar Papers


Publications referenced by this paper.
Showing 1-7 of 7 references

Domination in Graphs: Advanced Topics

  • T. W. Haynes, S. T. Hedetniemi, P. J. Slater
  • Marcel Dekker, New York
  • 1998
2 Excerpts

Dominating partitions of graphs

  • E. Cockayne, S. Hedetniemi
  • tech. rep.
  • 1979
1 Excerpt

Theory of Graphs

  • O. Ore
  • no. 38 in American Mathematical Society…
  • 1962
1 Excerpt

Theory of Graphs and its Applications

  • C. Berge
  • no. 2 in Collection Universitaire de…
  • 1958
1 Excerpt

Similar Papers

Loading similar papers…