树图的2-距离和可区别染色  

2-distance sum distinguishing coloring of trees

作　　者：刘欢 强会英[1] 王洪申[2] 白羽 LIU Huan;QIANG Huiying;WANG Hongshen;BAI Yu(School of Mathematics and Physics,Lanzhou Jiaotong University,Lanzhou 730070,Gansu,China;College of Mechanical and Electrical Engineering,Lanzhou University of Technology,Lanzhou 730050,Gansu,China)

机构地区：[1]兰州交通大学数理学院,甘肃兰州730070 [2]兰州理工大学机电工程学院,甘肃兰州730050

出　　处：《山东大学学报（理学版）》2024年第2期47-52,58,共7页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(61962035)。

摘　　要：根据树图的结构特点,应用数学归纳法、组合分析法及组合零点定理,研究了图G的2-距离和可区别边染色和全染色问题,得到了树的2-距离和可区别边色数和全色数。Based on the structural characteristics of the trees,the 2-distance sum distinguishing edge(total)coloring of trees are studied by using the mathematical induction,combination analytic method and Combinatorial Nullstellensatz,and the 2-distance sum distinguishing edge(total)chromatic numbers are obtained.

关 键 词：树图 2-距离和可区别边色数 2-距离和可区别全色数 

分 类 号：O157.5[理学—数学]