摘要
对一个正常边染色满足相邻点的色集不同,称为邻强边染色,其所用最少染色数称为邻强边色数。就星Sm与扇Fn的联图Sm∨Fn,得到了在m,n不同取值情况下的邻强边色数。
A proper edge coloring is called adjacent strong edge coloring if colored sets from every two adjacent vertex incident edges are different. The minimum of colors required is called an adjacent strong edge coloring. A simple graph G is denoted by X＇as（G）. The adjacent strong edge chromatic number of Sm∨Fn is given.
出处
《苏州科技学院学报（自然科学版）》
CAS
2008年第2期11-14,共4页
Journal of Suzhou University of Science and Technology （Natural Science Edition）
基金
西北民族大学中青年科研基金(X2007-012)
国家民委科研项目(05XB07)
关键词
星
扇
联图
邻强边色数
star
fan
join-graph
adjacent strong edge chromatic number
