一些特殊图的中间图的2-距离和可区别全染色

兰州理工大学学报 ›› 2024, Vol. 50 ›› Issue (3): 156-161.

一些特殊图的中间图的2-距离和可区别全染色

王同昕¹, 杨超^*1,2, 姚兵³

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

收稿日期:2022-07-21 出版日期:2024-06-28 发布日期:2024-07-02
通讯作者: 杨超(1988-),男,河南信阳人,博士,讲师.Email:yangchao@sues.edu.cn
基金资助:
国家自然科学基金(61672001,61662066,62072296)

The 2-distance sum distinguishing total colorings for middle graphs of some special classes of graphs

WANG Tong-xin¹, YANG Chao^1,2, YAO Bing³

1. School of Mathematics, Physics and Statistics, Shanghai University of Engineering Science, Shanghai 201620, China;
2. Center of Intelligent Computing and Applied Statistics, Shanghai University of Engineering Science, Shanghai 201620, China;
3. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China

Received:2022-07-21 Online:2024-06-28 Published:2024-07-02

摘要/Abstract

摘要： 为了进一步研究图的2-距离和可区别全染色问题,根据中间图的构造特点,通过构造染色函数,利用组合分析法得到了路,圈,星,扇,轮,双星以及轮环图的中间图的2-距离和可区别全色数.

关键词: 全染色, 2-距离和可区别全染色, 中间图

Abstract: To further study the problem of 2-distance sum distinguishing total coloring, according to the structural properties of middle graphs, by constructing coloring functions and taking advantage of the methods of combinatorial analysis, the 2-distance sum distinguishing total chromatic numbers for middle graphs of path, cycle, star, fan, wheel, double star and wheel-ring graph are obtained.

Key words: total coloring, 2-distance sum distinguishing total coloring, middle graphs

中图分类号:

O157.5

王同昕, 杨超, 姚兵. 一些特殊图的中间图的2-距离和可区别全染色[J]. 兰州理工大学学报, 2024, 50(3): 156-161.

WANG Tong-xin, YANG Chao, YAO Bing. The 2-distance sum distinguishing total colorings for middle graphs of some special classes of graphs[J]. Journal of Lanzhou University of Technology, 2024, 50(3): 156-161.