Neighbor sum distinguishing index of 2-degenerate graphs

被引：5
|
作者：
Hu, Xiaolan [1 ]
Chen, Yaojun [2 ]
Luo, Rong [3 ]
Miao, Zhengke [3 ]
机构：
[1] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China
[2] Nanjing Univ, Dept Math, Nanjing 210093, Jiangsu, Peoples R China
[3] Jiangsu Normal Univ, Sch Math & Stat, Xuzhou 221116, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2017年 / 34卷 / 03期
关键词：
Neighbor sum distinguishing edge colorings; 2-Degenerate; Maximum degree; DISTINGUISHING EDGE COLORINGS;
D O I：
10.1007/s10878-017-0110-8
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We consider proper edge colorings of a graph G using colors in . Such a coloring is called neighbor sum distinguishing if for each pair of adjacent vertices u and v, the sum of the colors of the edges incident with u is different from the sum of the colors of the edges incident with v. The smallest value of k in such a coloring of G is denoted by . In this paper we show that if G is a 2-degenerate graph without isolated edges, then .
引用
收藏
页码：798 / 809
页数：12
相关论文
共 48 条
12345