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

• 数学 • 上一篇    下一篇

点不交的m个C3]的并的点可区别全染色

辛小青1,2, 王治文3, 陈祥恩1, 姚兵1   

  1. 1. 西北师范大学 数学与信息科学学院, 兰州 730070|2. 包头师范学院 数学科学学院, 内蒙古 包头 014030;3. 宁夏大学 数学计算机学院, 银川 750021
  • 收稿日期:2011-02-03 出版日期:2012-03-26 发布日期:2012-03-21
  • 通讯作者: 陈祥恩 E-mail:chenxe@nwnu.edu.cn

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

摘要:

利用μ(G)的定义确定了点不交的m个C3(m≥2)的并的点可区别全色数的下界, 并借助矩阵给出了点不交的m个C3(m≥2)的并的点可区别全染色方法, 进而确定了它的点可区别全色数.

关键词: 图, 点可区别全染色, 点可区别全色数, 点不交的并

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

中图分类号: 

  • O157.5