吉林大学学报（理学版）2011，Vol.49Issue(1)：68-70,3.
图Kcr∨Ks的邻点可区别全色数
Adjacent-Vertex-Distinguishing Total Chromatic Number of Kcr ∨ Ks
摘要
Abstract
The adjacent-vertex-distinguishing total chromatic number of Kcr ∨ Ks, the join of empty graph of order r and complete graph of order s, was discussed via the method of combinatory analysis. One important result Xat (Kcr ∨ Ks) = r + s + 2 holds when r + s is an odd number and s ＞ r2 + 2r - 1, where Xat (G) represents the adjacent-vertex-distinguishing total chromatic number.关键词
邻点可区别全染色/邻点可区别全色数/联图Key words
adjacent-vertex-distinguishing total coloring/ adjacent-vertex-distinguishing total chromatic number/ join of graphs分类
数理科学引用本文复制引用
陈祥恩,马彦荣..图Kcr∨Ks的邻点可区别全色数[J].吉林大学学报（理学版）,2011,49(1):68-70,3.基金项目
国家自然科学基金(批准号:10771091)和甘肃省教育厅科研基金(批准号:0501-02). （批准号:10771091）
