| 一些倍图的点可区别均匀边色数 |
| |
| 引用本文： | 马刚,马少仙,张忠铺.一些倍图的点可区别均匀边色数[J].经济数学,2008,25(4). |
| |
| 作者姓名： | 马刚 马少仙 张忠铺 |
| |
| 作者单位： | 1. 西北民族大学计算机科学与信息工程学院,甘肃壮兰州,730124
2. 兰州交通大学应用数学研究所,甘肃兰州,730070 |
| |
| 基金项目： | 国家自然科学基金资助项目(No.40301037); 国家民委科研项目(No.05XB07); 西北民族大学中青年科研基金项目(No.X2007-012) |
| |
| 摘 要： | 如果图G的一个正常边染色满足任意两个不同点的关联边色集不同,且任意两种颜色所染边数目相差不超过1,则称为点可区别均匀边染色,其所用最少染色数称为点可区别均匀边色数.本文得到了星、扇和轮的倍图的点可区别均匀边色数.
|
| 关 键 词： | 倍图 点可区别均匀边染色 点可区别均匀边色数 |
ON THE VERTEX-DISTINGUISHING-EQUITABLE EDGE CHROMATIC NUMBER OF SOME DOUBLE-GRAPHS |
| |
| Ma Gang,Ma Shaoxian,Zhang Zhongfu.ON THE VERTEX-DISTINGUISHING-EQUITABLE EDGE CHROMATIC NUMBER OF SOME DOUBLE-GRAPHS[J].Mathematics in Economics,2008,25(4). |
| |
| Authors: | Ma Gang Ma Shaoxian Zhang Zhongfu |
| |
| Abstract: | A proper edge coloring of graph G is called vertex-distinguishing-equitable edge coloring if colored sets from any two vertices incident edge are different,and the number of edges in any two color classes differ by at most one,which the required minimum number of colors is called the vertex-distinguishing-equitable edge chromatic number.In this paper,we obtain the vertex-distinguishing-equitable edge chromatic numbers of double-graphs of star,fan and wheel. |
| |
| Keywords: | Double-graph vertex-distinguishing-equitable edge coloring vertex-distinguishing-equitable edge chromatic number |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
