| 关于积图点可区别边染色的若干结论 |
| |
| 引用本文： | 马刚,马效敏,冶建华,马少仙.关于积图点可区别边染色的若干结论[J].运筹学学报,2013,17(3):108-114. |
| |
| 作者姓名： | 马刚 马效敏 冶建华 马少仙 |
| |
| 作者单位： | 1. 西北民族大学数学与计算机科学学院, 兰州 730124
2. 西北民族大学科研处, 兰州 730030 |
| |
| 基金项目： | 国家自然科学基金(No. 61163037), 西北民族大学中央高校基本科研业务费专项资金(No. ZYZ2011082), 西北民族大学中青年科研基金(No. X2007-012) |
| |
| 摘 要： | 如果图G的一个正常边染色满足任意两个不同点的关联边色集不同, 则称为点可区别边染色(VDEC), 其所用最少颜色数称为点可区别边色数. 利用构造法给出了积图点可区别边染色的一个结论, 得到了关于积图点可区别边色数的若干结果, 并且给出25个具体积图的点可区别边色数, 验证了它们满足点可区别边染色猜想(VDECC).
|
| 关 键 词： | 积图 联图 点可区别边染色 点可区别边色数 |
Some conclusions of vertex-distinguishing edge coloring of product graph |
| |
| MA Gang,MA Xiaomin,YE Jianhua,MA Shaoxian.Some conclusions of vertex-distinguishing edge coloring of product graph[J].OR Transactions,2013,17(3):108-114. |
| |
| Authors: | MA Gang MA Xiaomin YE Jianhua MA Shaoxian |
| |
| Institution: | 1. College of Mathematics and Computer Science, Northwest University for Nationalities, Lanzhou 730124, China
2. Scientific Research Department, Northwest University for Nationalities, Lanzhou 730030, China |
| |
| Abstract: | A proper edge coloring of graph G is called vertex-distinguishing if the set of colors meets to vertex u differs from the set of colors meets to vertex v for any two distinct vertices u and v. The minimum number k for which there exists vertex distinguishing proper edge coloring using k colors is called the vertex distinguishing proper edge chromatic number. In this paper, we will obtain a conclusion of vertex-distinguishing edge coloring of product graph by using the method of construction, and get some results of the vertex-distinguishing edge chromatic numbers of product graphs, then obtain vertex-distinguishing edge chromatic numbers of 25 product graphs, which satisfy the conjecture on VDECC. |
| |
| Keywords: | product graph join-graph vertex-distinguishing edge coloring vertex-distinguishing edge chromatic number |
|
| 点击此处可从《运筹学学报》浏览原始摘要信息 |
| 点击此处可从《运筹学学报》下载免费的PDF全文 |
|
