联图P_(m)∨C_(n)的邻和可区别边染色  

NEIGHBOR SUM DISTINGUISHING EDGE COLORING OF JOIN GRAPHS P_(m)∨C_(n)

作　　者：白羽 强会英[1] BAI Yu;QIANG Hui-ying(School of Mathematics,Lanzhou Jiaotong University,Lanzhou,Gansu 730070,China)

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

出　　处：《井冈山大学学报（自然科学版）》2023年第6期7-13,共7页Journal of Jinggangshan University (Natural Science)

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

摘　　要：图G的邻和可区别边染色是指图G的一个正常边染色φ,满足图G中的任意一条边uv,点u关联边的颜色数之和异于点V。图G的一个邻和可区别k-边染色中用到的最小颜色数k,称为图G的邻和可区别边色数。本研究运用数学归纳法、分析法研究了联图P_(m)∨C_(n)的邻和可区别边染色问题,得到了联图P_(m)∨C_(n)的邻和可区别边色数。Let φ be a proper edge coloring of graph G, which satisfies the condition that for any edge UV in graph G, the chromatic sum of the edges associated with vertex U is different from vertex V,then φ is the neighbor sum distinguishing edge coloring of graph G. The neighbor sum distinguishing edge chromatic numbers of graph G is the smallest k such that graph G has a neighbor sum distinguishing k-edge coloring. In this paper,the neighbor sum distinguishing edge coloring problem of the join graph P_(m)∨C_(n) is studied by the methods of analysis and mathematical induction, the neighbor sum distinguishing edge chromatic numbers of the join graph P_(m)∨C_(n) are obtained.

关 键 词：联图 邻和可区别边染色 邻和可区别边色数 

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