摘要
以冠图的结构研究为基础,采用分析法和数学归纳法,对几类冠图的邻点可区别全染色问题进行了研究,得到了它们的邻点可区别全色数。
Based on the study of the structure of corona graph, the paper mainly discusses the adjacent vertex distinguishing total coloring of some corona 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 some corona graphs is obtained.
出处
《机械管理开发》
2008年第6期59-59,61,共2页
Mechanical Management and Development
关键词
星
圈
冠图
邻点可区别全染色
邻点可区别全色数
Star
, Cycle
Corona graph
Adjacent vertex distinguishing total coloring
Adjacent vertex distinguishing total chromatic number
