【摘要】 本文给出了E.J.Cockayne和S.T.Hedetniemi的下列猜想的一个新证明:当图G的团图为2-分图时,G的最小团的阶数不大于G的可达划分数;讨论了图的可达划分数与连通度的关系。更多还原

【Abstract】 A new method is given to prove the following conjecture posed by E.J, Cockayne and S.T. Hedetniemi. If the clique graph of a graph G is a bipartite graph, then the order of the smallest clique of G is less than or equal to the domatic number of G. And the relation between the domatic number and connectivity of a graph is discussed.更多还原