合成图的点可区别正常边色数

Vertex-Distinguishing Proper Edge-Coloring Chromatic Numbers of the Composition of Two Graphs

通过将图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.