《山东大学学报(理学版)》 ›› 2024, Vol. 59 ›› Issue (2): 47-52, 58.doi: 10.6040/j.issn.1671-9352.0.2022.347
Huan LIU1(),Huiying QIANG1,*(),Hongshen WANG2,Yu BAI1
摘要:
根据树图的结构特点, 应用数学归纳法、组合分析法及组合零点定理, 研究了图G的2-距离和可区别边染色和全染色问题, 得到了树的2-距离和可区别边色数和全色数。
中图分类号:
1 |
FLANDRIN E , MARCZYK A , PRZYBYLO J , et al. Neighbor sum distinguishing index[J]. Graphs and Combinatorics, 2013, 29 (5): 1329- 1336.
doi: 10.1007/s00373-012-1191-x |
2 |
PILSNIAK M , WONIAK M . On the total-neighbor-distinguishing index by sums[J]. Graphs and Combinatorics, 2015, 31 (3): 771- 782.
doi: 10.1007/s00373-013-1399-4 |
3 | 潘文华, 徐常青. 无K4-图子式的图的邻和可区别边染色[J]. 数学进展, 2017, 46 (6): 41- 49. |
PAN Wenhua , XU Changqing . Neighbor sum distinguishing edge colorings of K4-minor free graphs[J]. Advances in Mathematics, 2017, 46 (6): 41- 49. | |
4 |
YU Xiaowei , WANG Guanghui , WU Jianliang , et al. Neighbor sum distinguishing edge coloring of subcubic graphs[J]. Acta Mathematica Sinica, English Series, 2017, 33 (2): 252- 262.
doi: 10.1007/s10114-017-5516-9 |
5 | 田双亮, 杨环, 杨青, 等. 路的联的邻和可区别边染色[J]. 山东大学学报(理学版), 2020, 55 (9): 29- 35. |
TIAN Shuangliang , YANG Huan , YANG Qing , et al. Neighbor sum distinguishing edge coloring of the join of paths[J]. Journal of Shandong University(Natural Science), 2020, 55 (9): 29- 35. | |
6 | YAO Jingjing , YU Xiaowei , WANG Guanghui , et al. Neighbor sum distinguishing total coloring of 2-degenerate graphs[J]. Journal of Combinatorial Optimization, 2016, 34 (1): 1- 7. |
7 | 强会英, 姚丽. 无K4-子式图的2-距离和可区别边染色[J]. 山东大学学报(理学版), 2021, 56 (11): 83- 86. |
QIANG Huiying , YAO Li . 2-distance sum distinguishing edge coloring of K4-minor-free graphs[J]. Journal of Shandong University(Natural Science), 2021, 56 (11): 83- 86. | |
8 | 李泽鹏, 耿培伦, 陈祥恩. 树的D(r)-点可区别边染色[J]. 广州大学学报(自然科学版), 2020, 19 (1): 1- 7. |
LI Zepeng , GENG Peilun , CHEN Xiang'en . D(r)-vertex distinguishing edge coloring of trees[J]. Journal of Guangzhou University(Natural Science Edition), 2020, 19 (1): 1- 7. | |
9 |
SONG Hongjie , XU Changqing . Neighbor sum distinguishing total chromatic number of K4-minor free graph[J]. Frontiers of Mathematics in China, 2017, 12 (4): 937- 947.
doi: 10.1007/s11464-017-0649-9 |
10 |
ZHANG Zhongfu , LIU Linzhong , WANG Jianfang . Adjacent strong edge coloring of graphs[J]. Applied Mathematics Letters, 2002, 15 (5): 623- 626.
doi: 10.1016/S0893-9659(02)80015-5 |
11 | 谭钧铭, 强会英, 王洪申. 单圈图的邻和可区别边染色[J]. 山东大学学报(理学版), 2022, 57 (2): 78- 83. |
TAN Junming , QIANG Huiying , WANG Hongshen . Neighbor sum distinguishing edge coloring of unicyclic graphs[J]. Journal of Shandong University(Natural Science), 2022, 57 (2): 78- 83. | |
12 |
CHENG Xiaohan , DING Laihao , WANG Guanghui , et al. Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs[J]. Discrete Mathematics, 2020, 343 (7): 111856.
doi: 10.1016/j.disc.2020.111856 |
[1] | 孙晓玲,高玉斌,杜建伟,任建斌. 准树图的零阶广义Randic指数[J]. 《山东大学学报(理学版)》, 2022, 57(12): 96-102. |
[2] | 强会英,姚丽. 无K4-子式图的2-距离和可区别边染色[J]. 《山东大学学报(理学版)》, 2021, 56(11): 83-86. |
|