摘要
研究了W_m∨P_n(n≥5)的点可区别边染色,给出了W_m∨P_n(n≥5)的点可区别边色数.
Vertex distinguishing proper edge coloring of the join of wheel W_m and Path P_n（n≥5） are studied and the vertex distinguishing edge chromatic numbers of the join of wheel Wm and Path P_n（n≥5）are obtained in this paper.
出处
《临沂师范学院学报》
2010年第6期21-24,共4页
Journal of Linyi Teachers' College
关键词
轮
路
联图
点可区别边染色
点可区别边色数
wheel
path
the join of graphs
vertex distinguishing proper edge coloring
vertex distinguishing proper edge chromatic numbers
