吉林大学学报（理学版）2025，Vol.63Issue(2)：375-381,7.DOI:10.13413/j.cnki.jdxblxb.2024135
圈图与简单图的冠图的D(2)-点和可区别边染色的界
Bound of D(2)-Vertex Sum Distinguishing Edge-Coloring of Corona Graph of a Cycle and Simple Graphs
摘要
Abstract
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)-点和可区别边色数Key words
cycle graph/simple graph/corona graph/D(2)-vertex sum distinguishing edge-coloring/D(2)-vertex sum distinguishing edge-coloring number分类
数理科学引用本文复制引用
何静,强会英..圈图与简单图的冠图的D(2)-点和可区别边染色的界[J].吉林大学学报（理学版）,2025,63(2):375-381,7.基金项目
国家自然科学基金(批准号:61962035). （批准号:61962035）
