J4 ›› 2012, Vol. 50 ›› Issue (4): 686-692.

• 化学 • 上一篇    下一篇

mK的点可区别全染色mK的点可区别全染色

陈祥恩1, 王治文2, 马彦荣1, 姚兵1   

  1. 1. 西北师范大学 数学与信息科学学院, 兰州 730070|2. 宁夏大学 数学计算机学院, 银川 750021
  • 收稿日期:2011-09-22 出版日期:2012-07-01 发布日期:2012-09-07
  • 通讯作者: 陈祥恩 E-mail:chenxe@nwnu.edu.cn

Vertex-Distinguishing Total Colorings-of-mK4

CHEN Xiangen1, WANG Zhiwen2, MA Yanrong1, YAO Bing1   

  1. 1. College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China;
    2. School of Mathematics and Computer Science, Ningxia University, Yinchuan 750021, China
  • Received:2011-09-22 Online:2012-07-01 Published:2012-09-07
  • Contact: CHEN Xiangen1 E-mail:chenxe@nwnu.edu.cn

摘要:

 利用色集事先分配法, 借助于矩阵构造具体染色及递归法的方法, 研究图的点可区别全染色问题, 给出了m个K4的点不交的并mK4的点可区别全色数χvt(mK4)的确切值, 即“如果k-14<4m≤k4, m≥2, k≥6, 则χvt(mK4)=k”. 验证了VDTC猜想对mK4成立.

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

Abstract:

 The problem of vertex-distinguishing total colorings of graphs was discussed via the methods of distributing color sets in advance, constructing concrete coloring with the help of matrices and recurrence method. The exact value of the vertex-distinguishing total chromatic number χvt(mK4) of the union mK4 of m vertex-disjoint K4 was given, that is “If k-14<4m≤k4, m≥2, k≥6, then χvt(mK4)=k”. This illustrates that  the VDTC conjecture is valid for mK4.

Key words: graphs, vertexdistinguishing total coloring, vertexdistinguishing total chromatic number

中图分类号: 

  •