联图的邻点可区别无圈边染色  

Coloring of adjacent vertex-distinguishing acyclic edge of union graphs

作　　者：刘信生[1] 王志强[1] 孙春虎[1] 

机构地区：[1]西北师范大学数学与信息科学学院,甘肃兰州730070

出　　处：《兰州理工大学学报》2012年第2期131-135,共5页Journal of Lanzhou University of Technology

基　　金：甘肃省自然科学基金(3ZS051-A25-025)

摘　　要：根据图的邻点可区别无圈边染色的定义,利用构造的方法讨论联图Pm∨Wn、Pm∨Fn、Pm∨Pn、Pm∨Sn和Cm,n的邻点可区别无圈边染色,并给出它们的邻点可区别无圈边色数及其证明,且均满足图的邻点可区别无圈边染色猜想.According to the definition of coloring of adjacent vertex-distinguishing acyclic edge of graphs,the coloring of the adjacent vertex-distinguishing acyclic edge of union graphs Pm∨Wn,Pm∨Fn,Pm∨Pn,Pm∨Sn and Cm,n was discussed with construction method.Then the chromatic number of adjacent vertex-distinguishing acyclic edge was given and it was proved that the conjecture of satisfactory coloring of the adjacent vertex-distinguishing acyclic edge held true.

关 键 词：联图 邻点可区别无圈边染色 邻点可区别无圈边色数 

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