Proof of a local antimagic conjecture

Abstract

An antimagic labelling of a graph $G$ is a bijection $f:E(G)\to \{1,\dots ,E(G)\}$ such that the sums $S_v={\sum }_{e\ni v}f(e)$ distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1994) is that every connected graph other than $K_2$ admits an antimagic labelling. Recently, two sets of authors (Arumugam, Premalatha, Bača \& Semaničová-Feňovčíková (2017), and Bensmail, Senhaji \& Lyngsie (2017)) independently introduced the weaker notion of a local antimagic labelling, where only adjacent vertices must be distinguished. Both sets of authors conjectured that any connected graph other than $K_2$ admits a local antimagic labelling. We prove this latter conjecture using the probabilistic method. Thus the parameter of local antimagic chromatic number, introduced by Arumugam et al., is well-defined for every connected graph other than $K_2$ .

Final version for publication in DMTCS. Changes from previous version are formatting to journal style and correction of two minor typographical errors

References in corpus (1)

• The 1-2-3 Conjecture and related problems: a survey

Cited by in corpus (1)

• Every Graph Is Local Antimagic Total And Its Applications To Local Antimagic (Total) Chromatic Numbers