|
|||||
|
|
| D(2)-点可区别正常边色数的一个上界 | |
| 引用本文： | 刘利群,王治文,陈祥恩.D(2)-点可区别正常边色数的一个上界[J].数学的实践与认识,2012,42(13):202-206. |
| 作者姓名： | 刘利群 王治文 陈祥恩 |
| 作者单位： | 1. 长江大学信息与数学学院,湖北荆州,434023 2. 宁夏大学数学计算机学院,宁夏银川,750021 3. 西北师范大学数学与信息科学学院,甘肃兰州,730070 |
| 基金项目： | 国家自然科学基金资助项目，西北师范大学“知识与科技创新工程”项目，宁夏自然基金项目，宁夏大学科学研究基金项目( |
| 摘 要： | 图G的D(β)-点可区别正常边染色是指G的一个正常边染色f使得对任意两点u,v∈V(G),0 |
| 关 键 词： | D(2)-点可区别的正常边染色 D(2)-点可区别的正常边色数 上界 |
An Upper Bound for D(2)-Vertex Distinguishing Proper Edge Chromatic Number of Graphs |
|
| LIU li-qun , WANG Zhi-wen , CHEN Xiang-en.An Upper Bound for D(2)-Vertex Distinguishing Proper Edge Chromatic Number of Graphs[J].Mathematics in Practice and Theory,2012,42(13):202-206. | |
| Authors: | LIU li-qun WANG Zhi-wen CHEN Xiang-en |
| Institution: | 1.Information and Mathematics College,Yangtze University,Jingzhou 434020,China) (2.School of Mathematics and Computer Science,Ningxia University,Yinchuan 750021,China) (3.College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China) |
| Abstract: | A D（β）-vertex distinguishing edge-coloring of a simple graph G is a proper edgecoloring of G such that no pair of vertices which distance is no more thanβmeets the same sets of colors.In this paper,we have discussed the D（2）-vertex distinguishing proper edge coloring of graphs and obtained when δ≥max{(31/2/2)Δ:(2(343/2/3},the D（2）-vertex distinguishing proper edge chromatic number of G does not exceed△+ 5 by using the General Local Lemma. |
| Keywords: | D(2)-vertex-distinguishing proper edge-coloring D(2)-vertex distinguishing proper edge chromatic numbet upper bound |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |