Indexed by:
Abstract:
An antimagic labelling of a graph G with m edges is a bijection f: E(G) → { 1 , … , m} such that for any two distinct vertices u, v we have ∑ e ∈ E ( v )f(e) ≠ ∑ e ∈ E ( u )f(e) , where E(v) denotes the set of edges incident v. The well-known Antimagic Labelling Conjecture formulated in 1994 by Hartsfield and Ringel states that any connected graph different from K2 admits an antimagic labelling. A weaker local version which we call the Local Antimagic Labelling Conjecture says that if G is a graph distinct from K2, then there exists a bijection f: E(G) → { 1 , … , | E(G) | } such that for any two neighbours u, v we have ∑ e ∈ E ( v )f(e) ≠ ∑ e ∈ E ( u )f(e). This paper proves the following more general list version of the local antimagic labelling conjecture: Let G be a connected graph with m edges which is not a star. For any list L of m distinct real numbers, there is a bijection f: E(G) → L such that for any pair of neighbours u, v we have that ∑ e ∈ E ( v )f(e) ≠ ∑ e ∈ E ( u )f(e). © 2018, Springer Japan KK, part of Springer Nature.
Keyword:
Reprint 's Address:
Email:
Source :
Graphs and Combinatorics
ISSN: 0911-0119
Year: 2018
Issue: 6
Volume: 34
Page: 1363-1369
0 . 4 8 8
JCR@2018
0 . 6 0 0
JCR@2023
ESI HC Threshold:68
JCR Journal Grade:4
CAS Journal Grade:4
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 1
Affiliated Colleges: