| 关于图K_(2n)-E(C_4)的点可区别边色数 |
| |
| 引用本文： | 王治文,朱恩强,李敬文.关于图K_(2n)-E(C_4)的点可区别边色数[J].数学的实践与认识,2010,40(4). |
| |
| 作者姓名： | 王治文 朱恩强 李敬文 |
| |
| 作者单位： | 1. 宁夏大学,数学计算机学院,宁夏,银川,750021
2. 兰州交通大学,应用数学研究所,甘肃,兰州,730070 |
| |
| 基金项目： | 国家自然科学基金(10771091); 宁夏大学科学研究基金((E)ndzr09-15) |
| |
| 摘 要： | 图G的一个k-正常边染色f被称为点可区别边染色是指任何两点的点及其关联边的色集合不同,所用最小的正整数k被称为G的点可区别边色数,记为x′_(vd)(G).用K_(2n)-E(C_4)表示2n阶完全图删去其中一条4阶路的边后得到的图,文中得到了K_(2n)-E(_4)的点可区别边色数.
|
| 关 键 词： | 边染色 图的点可区别边染色 图的点可区别边色数 |
On the Vertex-distinguishing Edge Coloring of K2n-E(C4) |
| |
| WANG Zhi-wen,ZHU En-qiang,LI Jing-wen.On the Vertex-distinguishing Edge Coloring of K2n-E(C4)[J].Mathematics in Practice and Theory,2010,40(4). |
| |
| Authors: | WANG Zhi-wen ZHU En-qiang LI Jing-wen |
| |
| Institution: | WANG Zhi-wen~1,ZHU En-qiang~2,LI Jing-wen~2 (1.School of Mathematics , Computer Science,Ningxia University,Yinchuan 750021 China) (2.Institute of Applied Mathematics,Lanzhou Jiaotong University,Lanzhou,730070 China) |
| |
| Abstract: | Let G(V,E) be a connected graph.A k—proper edge coloring f of G(V,E) is said to be a k—vertex-distinguishing edge coloring iff C(u)≠C(v) for ■u,v∈V(G),u≠v,where C(u) = {f(uv)|uv∈E(G)}.And the minimum integer k is called the vertex-distinguishing edge chromatic number of G(V,E),denoted by x_(vd)(G).In this paper,we obtain the vertex-distinguishing edge chromatic number of K_(2n)—E(C_4) being 14,16 respectively,where K_(2n)—E(C_4) denotes the complete graph with order 2n deleted m edges of a Cycle with order 4 in K_(2n). |
| |
| Keywords: | edge coloring vertex-distinguishing edge coloring vertex-distinguishing edge chromatic number |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
