首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一些图的邻点可区别关联着色
引用本文:王雅琴,刘西奎,王英.一些图的邻点可区别关联着色[J].大学数学,2008,24(4).
作者姓名:王雅琴  刘西奎  王英
摘    要:在图的关联着色概念的基础上定义了图的邻点可区别关联着色及邻点可区别关联色数,研究了圈、完全二部图、Cm.Fn图的邻点可区别关联着色,并确定了它们的邻点可区别关联色数.

关 键 词:关联着色  关联色数  邻点可区别关联着色

Adjacent Vertex Distinguishing Incidence Colorings of Graphs
WANG Ya-qin,LIU Xi-kui,WANG Ying.Adjacent Vertex Distinguishing Incidence Colorings of Graphs[J].College Mathematics,2008,24(4).
Authors:WANG Ya-qin  LIU Xi-kui  WANG Ying
Abstract: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.
Keywords:incidence coloring  incidence coloring number  adjacent vertex distinguishing incidence coloring
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号