| 图K_（3,3）∨K_t的点可区别正常边染色 |
| |
| 引用本文： | 高毓平,王治文,陈祥恩,姚兵.图K_（3,3）∨K_t的点可区别正常边染色[J].山东大学学报(自然科学版),2012(2):60-64. |
| |
| 作者姓名： | 高毓平 王治文 陈祥恩 姚兵 |
| |
| 作者单位： | [1]西北师范大学数学与信息科学学院,甘肃兰州730070 [2]宁夏大学数学计算机学院,宁夏银川750021 |
| |
| 基金项目： | 国家自然科学基金资助项目（61163037,61163054）; 宁夏大学科学研究基金项目（（E）：ndzr10-7）; 西北师大“知识与科技创新工程”项目（nwnu-kjcxgc-03-61） |
| |
| 摘 要： | 图G的正常边染色称为是点可区别的,如果对G的任意两个不同的顶点u,v,与u关联的边的颜色构成的集合异于与v关联的边的颜色构成的集合。对图G进行点可区别正常边染色所需要的最少颜色数称为是G的点可区别正常边色数,记为χ＇s（G）。讨论了图K3,3∨Kt的点可区别正常边染色。
|
| 关 键 词： | 正常边染色 点可区别正常边染色 点可区别正常边色数 |
On the vertex-distinguishing proper edge-coloring of K_（3,3）∨K_t |
| |
| GAO Yu-ping,WANG Zhi-wen,CHEN Xiang-en,YAO Bing.On the vertex-distinguishing proper edge-coloring of K_（3,3）∨K_t[J].Journal of Shandong University(Natural Science Edition),2012(2):60-64. |
| |
| Authors: | GAO Yu-ping WANG Zhi-wen CHEN Xiang-en YAO Bing |
| |
| Institution: | 1(1.College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,Gansu,China; 2.School of Mathematics and Computer Science,Ningxia University,Yinchuan 750021,Ningxia,China) |
| |
| Abstract: | A k-proper edge coloring of a simple graph G is called vertex-distinguishing if for two arbitrarily different vertices u and v,the set of colors assigned to the edges incident to u differs from the set of colors assigned to the edges incident to v.The minimum number of colors required for a vertex-distinguishing proper edge-coloring of a simple graph G is called the vertex-distinguishing proper edge chromatic number of G and denoted by χ′s（G）.Vertex-distinguishing proper edge colorings of K3,3∨Kt are discussed. |
| |
| Keywords: | proper edge coloring vertex-distinguishing proper edge coloring vertex-distinguishing proper edge chromatic number |
| 本文献已被 维普 等数据库收录！ |
|
