| 联图的邻点全和可区别全染色 |
| |
| 引用本文： | 崔福祥,杨超,叶宏波,姚兵.联图的邻点全和可区别全染色[J].吉林大学学报(理学版),2022,60(1):44-0052. |
| |
| 作者姓名： | 崔福祥 杨超 叶宏波 姚兵 |
| |
| 作者单位： | 1. 上海工程技术大学 数理与统计学院, 智能计算与应用统计研究中心, 上海 201620;
2. 西北师范大学 数学与统计学院, 兰州 730070 |
| |
| 基金项目： | 国家自然科学基金;上海工程技术大学研究生科研创新项目 |
| |
| 摘 要： | 考虑路与路、 路与圈、 圈与圈三类联图的邻点全和可区别全染色问题, 通过构造边染色矩阵, 利用组合分析法和分类讨论的思想,
得到了路与路、 路与圈、 圈与圈三类联图的邻点全和可区别全色数的精确值.
|
| 关 键 词： | 正常全染色 点可区别染色 邻点全和可区别全染色 邻点全和可区别全色数 |
| 收稿时间： | 2021-03-31 |
Neighbor Full Sum Distinguishing Total Coloring of Join Graphs |
| |
| CUI Fuxiang,YANG Chao,YE Hongbo,YAO Bing.Neighbor Full Sum Distinguishing Total Coloring of Join Graphs[J].Journal of Jilin University: Sci Ed,2022,60(1):44-0052. |
| |
| Authors: | CUI Fuxiang YANG Chao YE Hongbo YAO Bing |
| |
| Institution: | 1. Center of Intelligent Computing and Applied Statistics, School of Mathematics, Physics and Statistics, Shanghai University of Engineering Science, Shanghai 201620, China;
2. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China
|
| |
| Abstract: | We considered the problem of the neighbor full sum distinguishing total coloring of three types of join graphs which consisting of paths and paths, paths and cycles, cycles and cycles. By constructing edge coloring matrix, using the methods of combinatorial analysis and categorical discussion, we obtained the exact value of the neighbor full sum distinguishing total chromatic number of three types of join graphs: paths and paths, paths and cycles, cycles and cycles. |
| |
| Keywords: | proper total coloring vertex distinguishing coloring neighbor full sum distinguishing total coloring neighbor full sum distinguishing total chromatic number |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
|
