摘要
得到了Wm∨Wn的邻点可区别边色数,其中Wm与Wn分别表示m+1阶和n+1阶的轮, Wm∨Wn表示Wm和Wn的联图.
The adjacent vertex-distinguishing edge chromatic number of join graph of wheel Wm and wheel Wn is obtained in this paper, where Win, Wn denote wheels with order m + 1 and wheels with order n + 1, respectively.
出处
《兰州大学学报(自然科学版)》
CAS
CSCD
北大核心
2007年第1期113-115,共3页
Journal of Lanzhou University(Natural Sciences)
基金
Supported by the National Natural Science Foundation of China(40301037).
关键词
轮
联图
邻强边色数
wheel
join-graph
adjacent vertex-distinguishing edge chromatic number