关于两类特殊图的邻点可区别全染色  

On the Adjacent Vertex Distinguishing Total Coloring of Two Special Graphs

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

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

出　　处：《机械管理开发》2012年第3期87-87,89,共2页Mechanical Management and Development

摘　　要：为了解决图的邻点可区别全染色问题中一个图的色数算法,基于图的结构研究,采用分析法和数学归纳法,研究了两类特殊图的邻点可区别全染色问题,得到了其邻点可区别全色数。Based on the study of the structure of graph, the paper mainly discusses the adjacent vertex distinguishing total coloring of two spe- cial graphs to resolve the algorithm of the chromatic number of a graph. It＇s proved by using analysis method and mathematical induction. The adjacent vertex distinguishing total chromatic number of two special graphs is obtained.

关 键 词：圈 冠图 邻点可区别全染色 邻点可区别全色数 

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