子立方图的2-距离和可区别边色数  

TWO-DISTANCE NEIGHBOR SUM DISTINGUISHING INDEX OF SUBCUBIC GRAPHS

作　　者：何正月 梁立[1] 高炜[1] He Zhengyue;Liang Li;Gao Wei(School of Information Science and Technology,Yunnan Normal University,Kunming 650500)

机构地区：[1]云南师范大学信息学院,昆明650500

出　　处：《南京大学学报（数学半年刊）》2023年第1期72-86,共15页Journal of Nanjing University(Mathematical Biquarterly)

基　　金：Supported by National Science Foundation of China(No.12161094)。

摘　　要：2-距离和可区别边色数χ′2−P(G)是指使图G有一个正常边染色且任意一对距离为2的顶点的颜色集合的和不相等的最小颜色数值k.本文证明了:若图G是子立方图,则有χ′2−P(G)≤9.The 2-distance sum distinguishing indexχ′2−P(G)of graph G is defined as the smallest integer k,for which the edges of G can be properly colored by using k colors.In this way,any pair of vertices at distance of two have distinct sum of colors.In this paper,it’s proved that if G is a subcubic graph,thenχ′2−P(G)≤9.

关 键 词：子立方图 2-距离和可区别边染色 组合零点定理 

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