Results

**1 - 2**of**2**### Regular graphs are antimagic

"... An undirected simple graph G = (V,E) is called antimagic if there exists an injective function f: E → {1,..., |E|} such that ∑e∈E(u) f(e) 6 = ∑e∈E(v) f(e) for any pair of different nodes u, v ∈ V. In this note we prove – with a slight modification of an argument of Cranston et al. – that k-regular g ..."

Abstract
- Add to MetaCart

(Show Context)
An undirected simple graph G = (V,E) is called antimagic if there exists an injective function f: E → {1,..., |E|} such that ∑e∈E(u) f(e) 6 = ∑e∈E(v) f(e) for any pair of different nodes u, v ∈ V. In this note we prove – with a slight modification of an argument of Cranston et al. – that k-regular graphs are antimagic for k> 2.