Volume :1 , Issue :2 ,Page :80-95

Abstract : Let G be a simple graph with vertex set V and edge set E. A subset S of V is said to be a dom- chromatic set (or dc-set) if S is a dominating set an d the chromatic number of the graph induced by S is the chromatic number of G. The minimum cardinality of a dom-chromatic set in a graph G is called the dom-chromatic number (or dc - number) and is denoted by γ ch (G). In this paper, bounds for dom- chromatic numbers for bipartite graphs are discussed.