若干图的倍图的均匀邻强边染色  

On the equitable adjacent strong edge coloring of double graph of some graphs

作　　者：马刚[1] 张忠辅[2] 

机构地区：[1]西北民族大学计算机科学与信息工程学院,甘肃兰州730124 [2]兰州交通大学应用数学研究所,甘肃兰州730070

出　　处：《纯粹数学与应用数学》2010年第1期64-68,共5页Pure and Applied Mathematics

基　　金：国家自然科学基金(40301037);国家民委科研项目(05XB07);西北民族大学中青年科研基金(X2007-012)

摘　　要：如果图G的一个正常边染色满足相邻点的色集不同,且任意两种颜色所染边数目相差不超过1,则称为均匀邻强边染色,其所用最少染色数称为均匀邻强边色数.本文得到了星、扇和轮的倍图的均匀邻强边色数.A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent 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 equitable adjacent strong edge chromatic number. In this paper, we obtain the equitable adjacent strong edge chromatic numbers of double graphs of star, fan and wheel.

关 键 词：倍图 均匀邻强边染色 均匀邻强边色数 

分 类 号：O157.5[理学—数学]