吉林大学学报(理学版)

• 数学 • 上一篇    下一篇

完全二部图K2,n和K3,n的一般点可区别全染色

陈祥恩1, 苏丽1, 王治文2   

  1. 1. 西北师范大学 数学与统计学院, 兰州 730070; 2.宁夏大学 数学统计学院, 银川 750021
  • 收稿日期:2016-04-29 出版日期:2016-11-26 发布日期:2016-11-29
  • 通讯作者: 陈祥恩 E-mail:chenxe@nwnu.edu.cn

General VertexDistinguishing Total Colorings ofComplete Bipartite Graphs K2,nand K3,n

CHEN Xiang’en1, SU Li1, WANG Zhiwen2   

  1. 1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China;2. School of Mathematics and Statistics, Ningxia University, Yinchuan 750021, China
  • Received:2016-04-29 Online:2016-11-26 Published:2016-11-29
  • Contact: CHEN Xiang’en E-mail:chenxe@nwnu.edu.cn

摘要: 借助已有的完全二部图K2,n和K3,n的点可区别IE全色数的结论, 利用组合分析及构造具体染色的方法探讨完全二部图K2,n和K3,n的一般点可区别全染色问题, 确定了K2,n和K3,n的一般点可区别全色数.

关键词: 完全二部图, 一般点可区别全色数, 一般点可区别全染色, 一般全染色

Abstract: With the help of existing conclusions of vertex distinguishing IEtotal colorings of complete bipartite graphs K2,n and K3,n, we discussed the question on general vertexdistinguishing total colorings of complete bipartite graphs K2,n and K3,n by using the method of combinatorial analysis and constructing the specific colorings, and determined the general vertexdistinguishing total chromatic numbers of K2,nand K3,n.

Key words: general total coloring, general vertexdistinguishing total chromatic number, complete bipartite graphs, general vertexdistinguishing total coloring

中图分类号: 

  • O157.5