| 完全二部图K_(6,8)的点强可区别全染色 |
| |
| 引用本文： | 王蓓蓓,祁丽娟,刘信生,陈祥恩.完全二部图K_(6,8)的点强可区别全染色[J].吉林大学学报(理学版),2016,54(5):1027-1031. |
| |
| 作者姓名： | 王蓓蓓 祁丽娟 刘信生 陈祥恩 |
| |
| 作者单位： | 1. 西北师范大学 数学与统计学院, 兰州 730070; 2. 兰州工业学院 基础学科部, 兰州 730050 |
| |
| 摘 要： | 利用组合分析法,考虑完全二部图K_(6,8)的点强可区别全染色方案,给出一种可行的染色方案.结果表明,完全二部图K_(6,8)的点强可区别全色数为10.
|
| 关 键 词： | 完全二部图 点强可区别全染色 点强可区别全色数 |
| 收稿时间： | 2015-11-23 |
Vertex Strongly Distinguishing Total Coloringof Complete Bipartite Graph K6,8 |
| |
| WANG Beibei,QI Lijuan,LIU Xinsheng,CHEN Xiang’en.Vertex Strongly Distinguishing Total Coloringof Complete Bipartite Graph K6,8[J].Journal of Jilin University: Sci Ed,2016,54(5):1027-1031. |
| |
| Authors: | WANG Beibei QI Lijuan LIU Xinsheng CHEN Xiang’en |
| |
| Institution: | 1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China;2. Department of Basic Courses, Lanzhou Insititute of Technology, Lanzhou 730050, China |
| |
| Abstract: | By using the method of combinatorial analysis, we considered the vertex strongly distinguishing total coloring schemes of complete bipartite graph K6,8, and gave a feasible coloring scheme. The results show that the vertex strongly distinguishing total chromatic number of complete bipartite graph K6,8 is equal to ten. |
| |
| Keywords: | complete bipartite graph vertex strongly distinguishing total coloring vertex strongly distinguishing total chromatic number |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
|
