期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
On the Maximum Number of Dominating Classes in Graph Coloring
1
作者 Bing Zhou 《Open Journal of Discrete Mathematics》 2016年第2期70-73,共4页
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 a... 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]. 展开更多
关键词 Graph coloring dominating Sets dominating coloring classes Chromatic Number dominating Color Number
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部