Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) (Q681756)

In this paper, the authors investigate the neighbor sum distinguishing coloring of graphs, which is defined as a proper edge coloring such that for any edge \(uv\), the sum of colors assigned on incident edges of \(u\) is different from the sum of colors assigned on incident edges of \(v\). The smallest number of colors that a graph can have a neighbor sum distinguishing coloring with these colors is denoted by \(\chi^\prime_\Sigma(G)\). \textit{E. Flandrin} et al. [Graphs Comb. 29, No. 5, 1329--1336 (2013; Zbl 1272.05047)] conjectured that \(\chi^\prime_\Sigma(G)\leq \Delta(G)+2\) for any connected graph \(G\cong C_5\) with at least \(3\) vertices and maximum degree \(\Delta(G)\). In this paper, the authors verify this conjecture for a normal graph with the maximum degree at least \(7\) and maximum average degree less that \(37/12\).