p_m×K_(n,n)的邻点可区别全染色  

On the adjacent vertex distinguishing total coloring of p_m×K_(n,n)

作　　者：孙晓玲[1] 杜建伟[1] 

机构地区：[1]中北大学理学院,山西太原030051

出　　处：《山东理工大学学报（自然科学版）》2009年第6期66-67,71,共3页Journal of Shandong University of Technology:Natural Science Edition

摘　　要：为了解决图的邻点可区别全染色问题中一个图的色数算法问题,以积图的结构研究为基础,采用分析法,对pm×Kn,n的邻点可区别全染色问题进行了研究,得到了它的邻点可区别全色数.Based on the study of the structure of productgraph,this paper mainly discusses the adjacent vertex distinguishing total coloring of pm×Kn,n to resolve the algorithm of the chromatic number of a graph.The adjacent vertex distinguishing total chromatic number of pm×Kn,n is obtained by using analysis method.

关 键 词：路 完全等二部图 积图 邻点可区别全染色 邻点可区别全色数 

分 类 号：O157.5[理学—数学]