| 图的距离不大于β的任意两点可区别的边染色 |
| |
| 引用本文： | 张忠辅,李敬文,陈祥恩,程辉,姚兵.图的距离不大于β的任意两点可区别的边染色[J].数学学报,2006,49(3):703-708. |
| |
| 作者姓名： | 张忠辅 李敬文 陈祥恩 程辉 姚兵 |
| |
| 作者单位： | [1]西北师范大学数学与信息科学学院,兰州730070 [2]兰州交通大学数理与软件工程学院,兰州730070 [3]兰州交通大学信息与电气工程学院,兰州730070 |
| |
| 基金项目： | 国家自然科学基金资助项目（40301037） |
| |
| 摘 要： | 本文提出了图的距离不大于β的任意两点可区别的边染色,即D(β)-点可区别的边染色(简记为D(β)-VDPEC)．并得到了一些特殊图类,如圈、完全图、完全二部图、扇、轮、树以及一些联图的D(β)-点可区别的边色数,文后提出了相关的猜想．
|
| 关 键 词： | 图 正常边染色 D(β)-点可区别的边色数 |
| 文章编号： | 0583-1431（2005）02-0703-06 |
| 收稿时间： | 2005-01-17 |
| 修稿时间： | 2005-01-172005-08-25 |
D(β)-Vertex-Distinguishing Proper Edge-Coloring of Graphs |
| |
| Zhong Fu ZHANG.D(β)-Vertex-Distinguishing Proper Edge-Coloring of Graphs[J].Acta Mathematica Sinica,2006,49(3):703-708. |
| |
| Authors: | Zhong Fu ZHANG |
| |
| Institution: | College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, P. R, China; School of Mathematics, Physics and Software Engineering, Lanzhou 3iaotong University Lanzhou 730070, P. R. China; Jing Wen LI Department of Computer, Lanzhou Jiaotong University, Lanzhou 730070, P. R. China; Xiang En CHEN Hui CHENG Bing YAO College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, P. R. China |
| |
| Abstract: | In this paper, we present a new concept of the D(β)-vertex-distinguishing proper edge-coloring of graphs (briefly, D(β)-VDPEC of graphs) and, meanwhile, have obtained the D(β)-VDPEC chromatic number on some families of graphs such as cycles, complete graphs, complete bipartite graphs, fans, wheels, trees conjecture is proposed. |
| |
| Keywords: | graph proper edge-coloring D(β)-vertex-distinguishing edge-chromatic number |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《数学学报》浏览原始摘要信息 |
| 点击此处可从《数学学报》下载免费的PDF全文 |
|
