DocumentCode :
2345943
Title :
On the Dominator Colorings in Bipartite Graphs
Author :
Gera, Ralucca
Author_Institution :
Dept. of Appl. Math., Naval Postgraduate Sch., Monterey, CA
fYear :
2007
fDate :
2-4 April 2007
Firstpage :
947
Lastpage :
952
Abstract :
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 Xd(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 Q1 cong P2, n ges 2), and more generally for bipartite graphs. We then conclude it with open questions for further research
Keywords :
graph colouring; hypercube networks; bipartite graphs; dominator chromatic number; dominator colorings; hypercube; vertex; Bipartite graph; Communication channels; Computer networks; Concurrent computing; Hypercubes; Mathematics; Multiprocessor interconnection networks; Polynomials; Shape; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology, 2007. ITNG '07. Fourth International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
0-7695-2776-0
Type :
conf
DOI :
10.1109/ITNG.2007.142
Filename :
4151818
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2345943
بازگشت