|
| 摘要: |
| 本文研究了积图的点可区别均匀边染色问题.利用构造法得到了积图G×G的点可区别均匀边染色的一个结论,并且获得了等阶的完全图与完全图、星与星、轮与轮的积图的点可区别均匀边色数,验证了它们满足点可区别均匀边染色猜想(VDEECC). |
| 关键词: 积图 点可区别均匀边染色 点可区别均匀边色数 |
| DOI： |
| 分类号:O157.5 |
| 基金项目:国家自然科学基金资助(61163037);甘肃省自然科学基金资助(145RJZA158)西北民族大学中央高校基本科研业务费专项资金资助(ZYZ2011082). |
|
| ON THE VERTEX-DISTINGUISHING-EQUITABLE EDGE CHROMATIC NUMBER OF SOME PRODUCT GRAPHS |
|
MA Gang
|
| Abstract: |
| In this paper, we discuss the problem of the vertex-distinguishing-equitable edge coloring on product graph. We get a conclusion of vertex-distinguishing-equitable edge coloring of product graph by using constructive method, and present the vertex-distinguishing-equitable edge chromatic numbers of product graphs of complete graph and complete graph, star and star, wheel and wheel, which satisfy the conjecture on VDEECC. |
| Key words: product graph vertex-distinguishing-equitable edge coloring vertex-distinguishing-equitable edge chromatic number |
