Discrete Mathematics & Theoretical Computer Science |

An antimagic labelling of a graph $G$ is a bijection $f:E(G)\to\{1,\ldots,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\v{c}a \& Semani\v{c}ová-Fe\v{n}ov\v{c}\'iková (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$ .

Source: arXiv.org:1705.09957

Volume: Vol. 20 no. 1

Section: Graph Theory

Published on: June 4, 2018

Accepted on: May 14, 2018

Submitted on: August 29, 2017

Keywords: Mathematics - Combinatorics,05C78, 05C15

Funding:

- Source : OpenAIRE Graph
*Random Graph Geometry and Convergence*; Funder: European Commission; Code: 639046

This page has been seen 840 times.

This article's PDF has been downloaded 604 times.