| 平方图的邻点全和可区别全染色 |
| |
| 引用本文： | 王芹,杨超,常景智,程银万,姚兵.平方图的邻点全和可区别全染色[J].华南师范大学学报(自然科学版),2022,54(1):107-112. |
| |
| 作者姓名： | 王芹 杨超 常景智 程银万 姚兵 |
| |
| 作者单位： | 1.上海工程技术大学数理与统计学院, 智能计算与应用统计研究中心, 上海 201620 |
| |
| 基金项目： | 国家自然科学基金项目(61662066)； |
| |
| 摘 要： | 进一步研究了平方图的邻点全和可区别非正常全染色问题: 利用平方图的结构构造了路、圈、毛毛虫、广义星以及最大度为3且不含2度点的树的平方图, 通过组合分析法得到上述5类平方图的邻点全和可区别非正常全色数。
|
| 关 键 词： | 非正常全染色 邻点全和可区别全染色 平方图 |
| 收稿时间： | 2021-04-24 |
Neighbor Full Sum Distinguishing Total Coloring of Square Graphs |
| |
| WANG Qin,YANG Chao,CHANG Jingzhi,CHENG Yinwan,YAO Bing.Neighbor Full Sum Distinguishing Total Coloring of Square Graphs[J].Journal of South China Normal University(Natural Science Edition),2022,54(1):107-112. |
| |
| Authors: | WANG Qin YANG Chao CHANG Jingzhi CHENG Yinwan YAO Bing |
| |
| Institution: | 1.School of Mathematics, Physics and Statistics, Center of Intelligent Computing and Applied Statistics, Shanghai University of Engineering Science, Shanghai 201620, China2.College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China |
| |
| Abstract: | To further study the problem of the neighbor full sum distinguishing non-proper total coloring of the square graphs, the structural of square graphs are used for constructing paths, cycles, caterpillars, generalized stars and trees with maximum degree 3 and having no vertex of degree 2. And the neighbor full sum distinguishing total chromatic improper number of the above five types of square graphs are determined with the combinatorial analysis. |
| |
| Keywords: | |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《华南师范大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《华南师范大学学报(自然科学版)》下载免费的PDF全文 |
|
