路的强积的邻点可区别边染色  

Adjacent Vertex Distinguishing Edge Coloring of Strong Product of Paths

作　　者：安卓莫 田双亮[1,2] 蔡瑾 AN Zhuo-mo;TIAN Shuang-liang;CAI Jin(School of Mathematics and Computer Science,Northwest Minzu University,Lanzhou 730030,China;Key Laboratory of Streaming Data Computing Technologies and Applications,Northwest Minzu University,Lanzhou 730030,China)

机构地区：[1]西北民族大学数学与计算机科学学院,甘肃兰州730030 [2]西北民族大学动态流数据计算与应用重点实验室,甘肃兰州730030

出　　处：《西北民族大学学报（自然科学版）》2020年第4期7-10,69,共5页Journal of Northwest Minzu University(Natural Science)

摘　　要：图G的邻点可区别边染色是指相邻点具有不同的色集的正常边染色,G的邻点可区别染色所需要的最少的颜色数称为G的邻点可区别边染色,记为χ'α(G).文章主要研究了两条路的强积的邻点可区别边染色,并给出了相应的邻点可区别边色数.An adjacent vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that no pair of adjacent vertices meets the same set of colors.The minimum number of colors required for an adjacent vertex distinguishing edge coloring of G is called the adjacent vertex distinguishing edge chromatic number of G,and denoted byχ'α(G).In this paper,we obtained the adjacent vertex distinguishing edge chromatic numbers of the strong product of two paths.

关 键 词：路 强积 邻点可区别边色 邻点可区别边色数 

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