J4 ›› 2012, Vol. 50 ›› Issue (02): 251-257.

Previous Articles     Next Articles

Vertex Distinguishing Total Chromatic Number of mC3

XIN Xiaoqing1,2, WANG Zhi\|wen3, CHEN Xiangen1, YAO Bing1   

  1. 1. College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China;2. School of Mathematics Science, Baotou Teachers&rsquo|College, Baotou 014030, Inner Mongolia Autonomous Region, China;3. School of Mathematics and Computer Science, Ningxia University, Yinchuan 750021, China
  • Received:2011-02-03 Online:2012-03-26 Published:2012-03-21
  • Contact: CHEN Xiangen E-mail:chenxe@nwnu.edu.cn

Abstract:

On  the basis of definition of μ(G), we got the lower bound of vertexdistinguishing total chromatic number of vertex disjoint mC3(m≥2), and then gave the concrete vertex\|distinguishing total coloring of vertex disjoint mC3(m≥2) with the help of matrix. Furthermore, we have obtained its vertex\|distinguishing total chromatic number.

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

CLC Number: 

  • O157.5