J4 ›› 2012, Vol. 50 ›› Issue (03): 504-.

• 数学 • 上一篇    下一篇

 图K15-E(K3)和K17-E(K3)的邻点可区别全染色

陈祥恩, 李泽鹏, 姚兵   

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

AdjacentVertexDistinguishing Total Coloring ofK15-E(K3)和K17-E(K3)

CHEN Xiangen, LI Zepeng, YAO Bing   

  1. College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China
  • Received:2011-08-19 Online:2012-05-26 Published:2012-05-28
  • Contact: CHEN Xiangen E-mail:chenxe@nwnu.edu.cn

摘要:

利用组合分析法和构造染色的方法, 讨论 图K15-E(K3)和K17-E(K3)的邻点可区别全染色, 确定了它们的邻点可区别全色数分别为16和19.

关键词: 图, 邻点可区别全染色, 邻点可区别全色数

Abstract:

Using the methods of combinatorial analysis and constructing concrete coloring, we discussed the adjacentvertexdistinguishing total coloring of K15-E(K3), K17-E(K3) and obtained  that  the adjacentvertexdistinguishing total chromatic numbers of K15-E(K3) and K17-E(K3) are 16 and 19 respectively.

Key words: graph, adjacentvertexdistinguishing total coloring, adjacentvertexdistinguishing total chromatic number

中图分类号: 

  • O157.5