On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree
Sign Up to like & getrecommendations! Published in 2017 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-017-1822-3
Abstract: A proper edge k-colouring of a graph $$G=(V,E)$$G=(V,E) is an assignment $$c:E\rightarrow \{1,2,\ldots ,k\}$$c:E→{1,2,…,k} of colours to the edges of the graph such that no two adjacent edges are associated with the same colour. A… read more here.
Keywords: sum; sum distinguishing; neighbour sum; edge ... See more keywords