| 联图的邻点可区别无圈边染色 |
| |
| 引用本文： | 刘信生,王志强,孙春虎.联图的邻点可区别无圈边染色[J].兰州理工大学学报,2012,38(2):131-135. |
| |
| 作者姓名： | 刘信生 王志强 孙春虎 |
| |
| 作者单位： | 西北师范大学 数学与信息科学学院,甘肃兰州,730070 |
| |
| 摘 要： | 根据图的邻点可区别无圈边染色的定义,利用构造的方法讨论联图Pm∨Wn、Pm∨Fn、Pm∨Pn、Pm∨Sn和Cm,n的邻点可区别无圈边染色,并给出它们的邻点可区别无圈边色数及其证明,且均满足图的邻点可区别无圈边染色猜想.
|
| 关 键 词： | 联图 邻点可区别无圈边染色 邻点可区别无圈边色数 |
Coloring of adjacent vertex-distinguishing acyclic edge of union graphs |
| |
| LIU Xin-sheng
,
WANG Zhi-qiang
,
SUN Chun-hu.Coloring of adjacent vertex-distinguishing acyclic edge of union graphs[J].Journal of Lanzhou University of Technology,2012,38(2):131-135. |
| |
| Authors: | LIU Xin-sheng WANG Zhi-qiang SUN Chun-hu |
| |
| Institution: | (College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | union graph coloring of adjacent vertex-distinguishing acyclic edge chromatic number of adjacent vertex-distinguishing acyclic edge |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
