井冈山大学学报（自然科学版）2023，Vol.44Issue(6)：7-13,7.DOI:10.3969/j.issn.1674-8085.2023.06.002
联图Pm∨Cn的邻和可区别边染色
NEIGHBOR SUM DISTINGUISHING EDGE COLORING OF JOIN GRAPHS Pm∨Cn
摘要
Abstract
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 Pm ∨ Cn is studied by the methods of analysis and mathematical induction,the neighbor sum distinguishing edge chromatic numbers of the join graph Pm ∨ Cn are obtained.关键词
联图/邻和可区别边染色/邻和可区别边色数Key words
join graphs/neighbor sum distinguishing edge coloring/neighbor sum distinguishing edge chromatic number分类
数理科学引用本文复制引用
白羽,强会英..联图Pm∨Cn的邻和可区别边染色[J].井冈山大学学报（自然科学版）,2023,44(6):7-13,7.基金项目
国家自然科学基金项目(61962035) （61962035）
