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
关键词
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
相关论文
共 50 条
  • [21] Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
    Yi Wang
    Jian Cheng
    Rong Luo
    Gregory Mulley
    Journal of Combinatorial Optimization, 2016, 31 : 874 - 880
  • [22] Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
    Wang, Yi
    Cheng, Jian
    Luo, Rong
    Mulley, Gregory
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (02) : 874 - 880
  • [23] An improved upper bound for the neighbor sum distinguishing index of graphs
    Wang, Guanghui
    Yan, Guiying
    DISCRETE APPLIED MATHEMATICS, 2014, 175 : 126 - 128
  • [24] Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs
    Jingjing Yao
    Xiaowei Yu
    Guanghui Wang
    Changqing Xu
    Graphs and Combinatorics, 2016, 32 : 1611 - 1620
  • [25] Neighbor Sum Distinguishing Index
    Flandrin, Evelyne
    Marczyk, Antoni
    Przybylo, Jakub
    Sacle, Jean-Francois
    Wozniak, Mariusz
    GRAPHS AND COMBINATORICS, 2013, 29 (05) : 1329 - 1336
  • [26] Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs
    Yao, Jingjing
    Yu, Xiaowei
    Wang, Guanghui
    Xu, Changqing
    GRAPHS AND COMBINATORICS, 2016, 32 (04) : 1611 - 1620
  • [27] Neighbor Sum Distinguishing Index
    Evelyne Flandrin
    Antoni Marczyk
    Jakub Przybyło
    Jean-François Saclé
    Mariusz Woźniak
    Graphs and Combinatorics, 2013, 29 : 1329 - 1336
  • [28] On the Total Neighbor Sum Distinguishing Index of IC-Planar Graphs
    Zhang, Donghan
    Li, Chao
    Chao, Fugang
    SYMMETRY-BASEL, 2021, 13 (10):
  • [29] ON THE GEOMETRIC THICKNESS OF 2-DEGENERATE GRAPHS
    Jain, Rahul
    Ricci, Marco
    Rollin, Jonathan
    Schulz, Andre
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2024, 15 (02) : 94 - 123
  • [30] NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
    Dong, Aijun
    Wang, Guanghui
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2012, 4 (04)