| 关于哈林图的邻和可区别染色的注记 |
| |
| 引用本文： | 程银万,杨超,姚兵. 关于哈林图的邻和可区别染色的注记[J]. 吉林大学学报(理学版), 2022, 60(4): 833-837 |
| |
| 作者姓名： | 程银万 杨超 姚兵 |
| |
| 作者单位： | 1. 上海工程技术大学 数理与统计学院, 智能计算与应用统计研究中心, 上海 201620;2. 西北师范大学 数学与统计学院, 兰州 730070 |
| |
| 摘 要： | 用三种树染色算法和组合分析法, 完成对哈林图的邻和可区别边染色、 邻和可区别全染色以及邻点全和可区别全染色, 并证明1-2-3 猜想和1-2猜想对哈林图均成立. 结果表明, 哈林图的邻点全和可区别全色数不超过3.
|
| 关 键 词： | 1-2-3猜想 1-2猜想 邻点全和可区别全染色 哈林图 |
| 收稿时间： | 2021-10-10 |
Notes on Neighbor Sum Distinguishing Coloring of Halin Graphs |
| |
| CHENG Yinwan,YANG Chao,YAO Bing. Notes on Neighbor Sum Distinguishing Coloring of Halin Graphs[J]. Journal of Jilin University: Sci Ed, 2022, 60(4): 833-837 |
| |
| Authors: | CHENG Yinwan YANG Chao YAO Bing |
| |
| Affiliation: | 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: | By using three types of tree coloring algorithms and combinatorial analysis, we completed the neighbor sum distinguishing edge coloring, the neighbor sum distinguishing total coloring and the neighbor full sum distinguishing total coloring of Halin graphs, and proved that the 1-2-3 conjecture and 1-2 conjecture were valid for Halin graphs. The results show that the neighbor full sum distinguishing total chromatic number of Halin graphs is not more than 3. |
| |
| Keywords: | 1-2-3 conjecture 1-2 conjecture neighbor full sum distinguishing total coloring Halin graph |
|
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
|
点击此处可从《吉林大学学报(理学版)》下载全文 |
|
