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

共 20 条

[1] r-Strong edge colorings of graphs [J].

Akbari, S. ;

Bidkhori, H. ;

Nosrati, N. .

DISCRETE MATHEMATICS, 2006, 306 (23) :3005-3010

[2] Adjacent vertex distinguishing edge-colorings [J].

Balister, P. N. ;

Gyori, E. ;

Lehel, J. ;

Schelp, R. H. .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (01) :237-250

[3] Acyclic edge coloring of 2-degenerate graphs [J].

Basavaraju, Manu ;

Chandran, L. Sunil .

JOURNAL OF GRAPH THEORY, 2012, 69 (01) :1-27

[4] On the Neighbor Sum Distinguishing Index of Planar Graphs [J].

Bonamy, M. ;

Przybylo, J. .

JOURNAL OF GRAPH THEORY, 2017, 85 (03) :669-690

[5] Strong Chromatic Index of 2-Degenerate Graphs [J].

Chang, Gerard Jennhwa ;

Narayanan, N. .

JOURNAL OF GRAPH THEORY, 2013, 73 (02) :119-126

[6]

Dong A., 2012, DISCRETE MATH ALGORI, V4, P125

[7]

Dong AJ, 2014, DISCRETE APPL MATH, V166, P84, DOI 10.1016/j.dam.2013.10.009

[8] On the neighbour-distinguishing index of a graph [J].

Edwards, Keith ;

Hornak, Mirko ;

Wozniak, Mariusz .

GRAPHS AND COMBINATORICS, 2006, 22 (03) :341-350

[9] Neighbor Sum Distinguishing Index [J].

Flandrin, Evelyne ;

Marczyk, Antoni ;

Przybylo, Jakub ;

Sacle, Jean-Francois ;

Wozniak, Mariusz .

GRAPHS AND COMBINATORICS, 2013, 29 (05) :1329-1336

[10] Δ+300 is a bound on the adjacent vertex distinguishing edge chromatic number [J].

Hatami, H .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 95 (02) :246-256

← 1 2 →