摘要
在图的关联着色概念的基础上定义了图的邻点可区别关联着色及邻点可区别关联色数,研究了圈、完全二部图、Cm.Fn图的邻点可区别关联着色,并确定了它们的邻点可区别关联色数.
The concepts of adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence coloring number of graphs are defined on the basis of the concept of incidence coloring of graphs. The adjacent vertex distinguishing incidence colorings of complete bipartite graphs, Cm· Fn, graphs are studied, of which the adjacent vertex distinguishing incidence coloring number are determined.
出处
《大学数学》
北大核心
2008年第4期64-68,共5页
College Mathematics
基金
国家自然科学基金资助项目(60503002)
关键词
关联着色
关联色数
邻点可区别关联着色
incidence coloring
incidence coloring number
adjacent vertex distinguishing incidence coloring
