J4 ›› 2011, Vol. 49 ›› Issue (02): 207-212.

Previous Articles     Next Articles

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

CHEN Xiangen, GAO Yuping   

  1. College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China
  • Received:2010-02-04 Online:2011-03-26 Published:2011-06-14
  • Contact: CHEN Xiangen E-mail:chenxe@nwnu.edu.cn

Abstract:

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),are thus obtained, where χ′s(G) represents the  vertex distinguishing proper edge chromatic number of G.

Key words: composition, vertexdistinguishing proper edge coloring, vertexdistinguishing proper edge chromatic number

CLC Number: 

  • O157.5