TITLE:
On the Maximum Number of Dominating Classes in Graph Coloring
AUTHORS:
Bing Zhou
KEYWORDS:
Graph Coloring, Dominating Sets, Dominating Coloring Classes, Chromatic Number, Dominating Color Number
JOURNAL NAME:
Open Journal of Discrete Mathematics,
Vol.6 No.2,
April
6,
2016
ABSTRACT: We investigate
the dominating-c-color number,, of a
graph G. That is the maximum number
of color classes that are also dominating when G is colored using colors. We show that where is the join of G and . This
result allows us to construct classes of graphs such that and thus provide some information regarding two
questions raised in [1] and [2].