摘要
通过将图G和H的合成图G[H]分解成一个直积图G□H和一个二分图Z的边不交并的方法,得到了χs'(G[H])≤χs'(G□H)+χ'(Z),χs'(P3[Pn])=2n+2,n=2,3;2n+3,4≤n≤10{,其中χs'(G)表示G的点可区别正常边色数.
The composition G[H] of two graphs G and H can be decomposed into two edge-disjoint graphs,one is their cartesian product G□H and the other is a bipartite graph Z,by which χ′s(G[H])≤χ′s(G□H)+χ′(Z),χ′s(P3)=are thus obtained,where χ′s(G) represents the vertex-distinguishing proper edge chromatic number of G.
出处
《吉林大学学报(理学版)》
CAS
CSCD
北大核心
2011年第2期207-212,共6页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:10771091)
关键词
合成
点可区别正常边染色
点可区别正常边色数
composition
vertex-distinguishing proper edge coloring
vertex-distinguishing proper edge chromatic number