Vertex-Distinguishing Proper Edge-Coloring Chromatic Numbers of the Composition of Two Graphs
Yuping Gao · Journal of Jilin University(Science Edition) · 2011
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.