圈图与简单图的冠图的D(2)-点和可区别边染色的界  

Bound of D(2)-Vertex Sum Distinguishing Edge-Coloring ofCorona Graph of a Cycle and Simple Graphs

作　　者：何静 强会英[1] HE Jing;QIANG Huiying(School of Mathematics and Physics,Lanzhou Jiaotong University,Lanzhou 730070,China)

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

出　　处：《吉林大学学报(理学版)》2025年第2期375-381,共7页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:61962035).

摘　　要：利用组合零点定理、构造染色法和数学归纳法,研究圈图与简单图的冠图的D(2)-点和可区别边染色问题,得到了圈图与简单图的冠图的D(2)-点和可区别边色数的界为Δ(G)+1,进而推出路图与简单图的冠图的界为Δ(G)+1.We studied the D(2)-vertex sum distinguishing edge-coloring problem of the corona graph of a cycle and a simple graphs by using combinatorial nullstellensatz,constructing coloring function and mathematical induction.We obtained that the bound of D(2)-vertex sum distinguishing edge-coloring of the corona graph of a cycle and a simple graphs wasΔ(G)+1,and then we derived that the bound of the corona graph of a path and a simple graphs wasΔ(G)+1.

关 键 词：圈图 简单图 冠图 D(2)-点和可区别边染色 D(2)-点和可区别边色数 

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