We consider proper edge colorings of a graph G using colors of the set {1, . . . , k}. Such a coloring is called neighbor sum distinguishing if for any pair of adjacent vertices x and y the sum of colors taken on the edges incident to x is different from the sum of colors taken on the edges incident to y. The smallest value of k in such a coloring of G is denoted by ndi (G). In the paper we conjecture that for any connected graph G = C 5 of order n ≥ 3 we have ndi (G) ≤ (G) + 2. We prove this conjecture for several classes of graphs. We also show that ndi (G) ≤ 7 (G)/2 for any graph G with (G) ≥ 2 and ndi (G) ≤ 8 if G is cubic.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.