完全二部图K6,8的点强可区别全染色

吉林大学学报(理学版)

完全二部图K_6,8的点强可区别全染色

王蓓蓓^1, 祁丽娟², 刘信生^1, 陈祥恩¹

1. 西北师范大学数学与统计学院, 兰州 730070; 2. 兰州工业学院基础学科部, 兰州 730050

收稿日期:2015-11-23 出版日期:2016-09-26 发布日期:2016-09-19
通讯作者: 祁丽娟 E-mail:282455295@qq.com

Vertex Strongly Distinguishing Total Coloringof Complete Bipartite Graph K_6,8

WANG Beibei¹, QI Lijuan², LIU Xinsheng¹, CHEN Xiang’en¹

1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China;2. Department of Basic Courses, Lanzhou Insititute of Technology, Lanzhou 730050, China

Received:2015-11-23 Online:2016-09-26 Published:2016-09-19
Contact: QI Lijuan E-mail:282455295@qq.com

摘要/Abstract

摘要：

利用组合分析法, 考虑完全二部图K_6,8 的点强可区别全染色方案, 给出一种可行的染色方案. 结果表明, 完全二部图K_6,8的点强可区别全色数为10.

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

Abstract:

By using the method of combinatorial analysis, we considered the vertex strongly distinguishing total coloring schemes of complete bipartite graph K_6,8, and gave a feasible coloring scheme. The results show that the vertex strongly distinguishing total chromatic number of complete bipartite graph K_6,8 is equal to ten.

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

中图分类号:

O157.5

王蓓蓓, 祁丽娟, 刘信生, 陈祥恩. 完全二部图K_6,8的点强可区别全染色[J]. 吉林大学学报(理学版), 2016, 54(05): 1027-1031.

WANG Beibei, QI Lijuan, LIU Xinsheng, CHEN Xiang’en. Vertex Strongly Distinguishing Total Coloringof Complete Bipartite Graph K_6,8[J]. Journal of Jilin University Science Edition, 2016, 54(05): 1027-1031.

[1]	杨伟光, 陈祥恩. 完全二部图K_9,n(9≤n≤92)的点可区别E-全染色[J]. 吉林大学学报(理学版), 2020, 58(2): 301-308.
[2]	师志凤, 陈祥恩, 王治文. 完全二部图K_6,n(6≤n≤38)的点可区别E全染色[J]. 吉林大学学报(理学版), 2018, 56(4): 845-852.
[3]	陈祥恩, 苏丽, 王治文. 完全二部图K_2,n和K_3,n的一般点可区别全染色[J]. 吉林大学学报(理学版), 2016, 54(06): 1289-1293.
[4]	李世玲, 陈祥恩, 王治文. 完全二部图K_3,n(3≤n≤17)的点可区别E-全染色[J]. 吉林大学学报(理学版), 2015, 53(06): 1171-1176.