摘要
邻点可区别关联着色的定义是在关联着色的基础上提出的,是使得相邻顶点的颜色集不同的关联着色.主要研究了几类特殊图的邻点可区别关联色数,包括风车图、齿轮图及在此基础上扩充的图Dm,n,拓展了图着色的领域,便于更好地研究图的结构.
The adjacent vertex-distinguishing incidence coloring is raised based on the definition of incidence oloring,and incidence coloring satisfiying the sets of the colors of two adjacent vertices are diffrent. We mostly study the adjacent vertex-distingushing incidence coloring number of some special graphs,including the windmill graph,gear graph and Dm、n. It exploits the area of the graph coloring and makes for studying the structure of graphs.
出处
《山东理工大学学报(自然科学版)》
CAS
2008年第5期105-107,共3页
Journal of Shandong University of Technology:Natural Science Edition
关键词
邻点可区别关联着色
风车图
齿轮图
adjacent vertex-distinguishing incidence coloring
windmill graph
gear graph