摘要
图G的一个正常边染色称作邻强边染色,若任意相邻两个的点的染色集合不相同,给图G进行邻强边染色所需的最少颜色数,称为图G的邻强边色数,此文讨论了轮的倍图的邻强边色数.即若Wn为n+1阶轮,则αs′(D(Wn))=2n(n≥4).
Proper edge coloring of G is called adjacent-strong,if for arbitrary two adjacent vertices with are incident to different sets of colored edges, then the minimum number require for an adjacent-strong edge coloring of G is called the adjacent-strong edge chromatic number. The adjacent strong edge chro- matic numbers on double graph of the wheel are discussed in this paper. If Wn is a wheel withorder n ＋ 1 ,then xas′（D（Wn）） = 2n（n ≥ 4）.
出处
《甘肃联合大学学报（自然科学版）》
2008年第3期22-23,共2页
Journal of Gansu Lianhe University :Natural Sciences
基金
国家自然科学基金资助项目(10771091)
关键词
轮
倍图
邻强边染色
邻强边色数
wheel
double graph
adjacent-strong edge coloring
adjacent-strong edge chromatic number
