| 一些积图的点可区别均匀边色数 |
| |
| 引用本文： | 马刚.一些积图的点可区别均匀边色数[J].数学杂志,2014,34(5):1005-1009. |
| |
| 作者姓名： | 马刚 |
| |
| 作者单位： | 西北民族大学数学与计算机科学学院; |
| |
| 基金项目： | 国家自然科学基金资助(61163037);甘肃省自然科学基金资助(145RJZA158);西北民族大学中央高校基本科研业务费专项资金资助(ZYZ2011082) |
| |
| 摘 要： | 本文研究了积图的点可区别均匀边染色问题.利用构造法得到了积图G×G的点可区别均匀边染色的一个结论,并且获得了等阶的完全图与完全图、星与星、轮与轮的积图的点可区别均匀边色数,验证了它们满足点可区别均匀边染色猜想(VDEECC).
|
| 关 键 词： | 积图 点可区别均匀边染色 点可区别均匀边色数 |
| 收稿时间： | 2013/4/2 0:00:00 |
| 修稿时间： | 2013/10/14 0:00:00 |
ON THE VERTEX-DISTINGUISHING-EQUITABLE EDGE CHROMATIC NUMBER OF SOME PRODUCT GRAPHS |
| |
| MA Gang.ON THE VERTEX-DISTINGUISHING-EQUITABLE EDGE CHROMATIC NUMBER OF SOME PRODUCT GRAPHS[J].Journal of Mathematics,2014,34(5):1005-1009. |
| |
| Authors: | MA Gang |
| |
| Institution: | College of Mathematics and Computer Science, Northwest University for Nationalities, Lanzhou 730124, China |
| |
| 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. |
| |
| Keywords: | product graph vertex-distinguishing-equitable edge coloring vertex-distinguishing-equitable edge chromatic number |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学杂志》浏览原始摘要信息 |
| 点击此处可从《数学杂志》下载免费的PDF全文 |
