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

• 数学 • 上一篇    下一篇

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

陈祥恩, 高毓平   

  1. 西北师范大学 数学与信息科学学院, 兰州 730070
  • 收稿日期:2010-02-04 出版日期:2011-03-26 发布日期:2011-06-14
  • 通讯作者: 陈祥恩 E-mail:chenxe@nwnu.edu.cn

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

摘要:

通过将图G和H的合成图G[H]分解成一个直积图G□H和一个二分图Z的边不交并的方法, 得到了χ′s(G[H])≤χ′s(G□H)+χ′(Z),其中χ′s(G)表示G的点可区别正常边色数.

关键词: 合成, 点可区别正常边染色, 点可区别正常边色数

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

中图分类号: 

  • O157.5