联图的邻点全和可区别全染色

吉林大学学报(理学版) ›› 2022, Vol. 60 ›› Issue (1): 44-0052.

联图的邻点全和可区别全染色

崔福祥¹, 杨超¹, 叶宏波¹, 姚兵²

1. 上海工程技术大学数理与统计学院, 智能计算与应用统计研究中心, 上海 201620;
2. 西北师范大学数学与统计学院, 兰州 730070

收稿日期:2021-03-31 出版日期:2022-01-26 发布日期:2022-01-26
通讯作者: 杨超 E-mail:yangchaomath0524@163.com

Neighbor Full Sum Distinguishing Total Coloring of Join Graphs

CUI Fuxiang¹, YANG Chao¹, YE Hongbo¹, YAO Bing²

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

Received:2021-03-31 Online:2022-01-26 Published:2022-01-26

摘要/Abstract

摘要： 考虑路与路、路与圈、圈与圈三类联图的邻点全和可区别全染色问题, 通过构造边染色矩阵, 利用组合分析法和分类讨论的思想,
得到了路与路、路与圈、圈与圈三类联图的邻点全和可区别全色数的精确值.

关键词: 正常全染色, 点可区别染色, 邻点全和可区别全染色, 邻点全和可区别全色数

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.

Key words: proper total coloring, vertex distinguishing coloring, neighbor full sum distinguishing total coloring, neighbor full sum distinguishing total chromatic number

中图分类号:

O157.5

崔福祥, 杨超, 叶宏波, 姚兵. 联图的邻点全和可区别全染色[J]. 吉林大学学报(理学版), 2022, 60(1): 44-0052.

CUI Fuxiang, YANG Chao, YE Hongbo, YAO Bing. Neighbor Full Sum Distinguishing Total Coloring of Join Graphs[J]. Journal of Jilin University Science Edition, 2022, 60(1): 44-0052.

[1]	杨超, 程银万, 姚兵. 三正则构造图的邻点全和可区别全染色[J]. 吉林大学学报(理学版), 2024, 62(6): 1301-1307.
[2]	李志军, 文飞. 单圈图的邻点全和可区别全染色[J]. 吉林大学学报(理学版), 2024, 62(3): 497-502.
[3]	程银万, 杨超, 姚兵. 关于哈林图的邻和可区别染色的注记[J]. 吉林大学学报(理学版), 2022, 60(4): 833-837.