几种图类的邻点可区别关联着色  

The Adjacent Vertex Distinguishing Incidence Coloring of Several Kinds of Graphs

作　　者：王雅琴[1] 王彩虹[2] 

机构地区：[1]青岛恒星职业技术学院教育学院,山东青岛266100 [2]青岛飞洋职业技术学院公共学院,山东青岛266111

出　　处：《泰山学院学报》2009年第3期20-22,共3页Journal of Taishan University

摘　　要：近年来,关于图着色问题的研究得到了许多有价值的结果,同时拓展出若干新的着色.图的邻点可区别关联着色是在图的关联着色概念的基础上提出的一种新的着色概念.本文研究了路、星、扇、轮、完全图的邻点可区别关联着色并确定了它们的邻点可区别关联色数.In recent years, the research of graph coloring theory has obtained many valuable results. At the same time, a lot of new coloring problems have been developed. The adjacent vertex distinguishing incidence coloring of graphs is a new defination of graph coloring defined on the basis of the concept of incidence coloring of graphs. In this paper, the adjacent vertex distinguishing incidence coloring of paths, stars, fans, wheels, complete graphs were studied and the adjacent vertex distinguishing incidence coloring numbers of them were determined.

关 键 词：图 关联着色 关联色数 

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