摘要
研究n阶完全图Kn(n≥20,n≡0(mod2))去掉4条独立边后的点可区别边染色,并给出了图Kn-{v1v2,v3v4,v5v6,v7v8}(n≥20,n≡0(mod2))的点可区别边色数。
We studied the vertex distinguishing edge coloring of Kn(n≥20,n≡0(mod2)) graph with four independent edges deleted,and obtained the vertex-distinguishing edge chromatic number of Kn-{ v1v2,v3v4,v5v6,v7v8} with n≡0(mod2) and n≥20,where Kn-{ v1v2,v3v4,v5v6,v7v8 } is denoted by the complete graph with order n deleted edges { v1v2,v3v4,v5v6,v7v8} of Kn.
出处
《吉林大学学报(理学版)》
CAS
CSCD
北大核心
2010年第5期777-782,共6页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:10771091)
宁夏大学科学研究基金(批准号:ndzr09-15)
关键词
边染色
点可区别边染色
点可区别边色数
edge coloring
vertex-distinguishing edge coloring
vertex-distinguishing edge chromatic number