paper

A note on asymptotically optimal neighbour sum distinguishing colourings

arXiv:1703.00406 · doi:10.1016/j.ejc.2018.10.009

Abstract

The least admitting a proper edge colouring of a graph without isolated edges such that for every is denoted by . It has been conjectured that for every connected graph of order at least three different from the cycle , where is the maximum degree of . It is known that for a graph without isolated edges. We improve this upper bound to using a simpler approach involving a combinatorial algorithm enhanced by the probabilistic method. The same upper bound is provided for the total version of this problem as well.

arXiv comment9 pages

References in corpus (1)

Cited by in corpus (4)