摘要
如果图G的一个正常边染色满足相邻点的色集不同,且任意两种颜色所染边数相差不超过1,则称为均匀邻强边染色,其所用最少染色数称为均匀邻强边色数.本文得到在m=1,2,3,n≥1和m=n≥4时的均匀邻强边色数.
A proper edge coloring of graph G is called equitable adjacent strong edge 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 derive the equitable adjacent strong edge chromatic numbers of Pn∨Sn at m=1,2,3,n≥1 and m=n≥4.
作者
吉毛卓玛
马刚
Jimao Zhuoma;Ma Gang(College of Mathematics and Computer Science,Northwest University for Nationnalities,Lanzhou 730124,China)
出处
《纯粹数学与应用数学》
2020年第1期119-126,共8页
Pure and Applied Mathematics
基金
国家自然科学基金(11361049)
国家民委科研项目(05XB07).
关键词
路
星
联图
均匀邻强边染色
均匀邻强边色数
path
star
join-graph
equitable adjacent strong edge coloring
equitable adjacent strong edge chromatic number
