吉林大学学报(理学版)

• 数学 • 上一篇    下一篇

完全二部图K6,n(6≤n≤38)的点可区别E全染色

师志凤1, 陈祥恩1, 王治文2   

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

VertexDistinguishing ETotal Coloring of Complete Bipartite Graph K6,n with 6≤n≤38

SHI Zhifeng1, CHEN Xiang’en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:2017-06-28 Online:2018-07-26 Published:2018-07-31
  • Contact: CHEN Xiang’en E-mail:chenxe@nwnu.edu.cn

摘要: 考虑完全二部图K6,n(6≤n≤38)的点可区别E全染色. 利用组合分析法、 反证法及构造染色的方法, 给出一类特殊完全二部图的点可区别E全染色. 结果表明: 当6≤n≤10时, K6,n的点可区别E全色数为5; 当11≤n≤38时, K6,n的点可区别E全色数为6.

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

Abstract: We considered vertexdistinguishing Etotal coloring of complete bipartite graph K6,n(6≤n≤38), and gave the vertexdistinguishing Etotal coloring of a class of special complete bipartite graph by using the methods of combinatorial analysis, reduction to absurdity and constructing concrete colorings. The results show that the vertexdistinguishing Etotal chromatic number of complete bipartite graph K6,n is 5 when 6≤n≤10 and is 6 when 11≤n≤38.

Key words: vertexdistinguishing Etotal chromatic number, Etotal coloring, vertexdistinguishing Etotal coloring, complete bipartite graph

中图分类号: 

  • O157.5