子立方图的2-距离严格邻点可区别边染色  

On 2-distance strict neighbor-distinguishing coloring of subcubic graphs

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

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

出　　处：《浙江师范大学学报（自然科学版）》2023年第3期249-253,共5页Journal of Zhejiang Normal University:Natural Sciences

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

摘　　要：2-距离严格邻点可区别边染色是指图G有一个正常边染色,且任意2个距离为2的顶点的颜色集合互不包含.2-距离严格邻点可区别边色数是指使图G有一个2-距离严格邻点可区别边染色的最小颜色数值,记作χ′_(2-snd)(G).采用反证法证明了:若图G是子立方图,则χ′_(2-snd)(G)≤7.The 2-distance strict neighbor-distinguishing edge coloring of graph G was a proper edge coloring of G such that color sets of any pair of vertices at distance two were not included with each other.The mininum number of colors required for 2-distance strict neighbor-distinguishing edge coloring of G was denoted byχ′_(2-snd)(G).It was proved that every subcubic graph G had an upper estimationχ′_(2-snd)(G)≤7 by contradiction.

关 键 词：2-距离严格邻点可区别边染色 2-距离严格邻点可区别边色数 正常边染色 子立方图 

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