Regular graphs are antimagic

Bérczi, Kristóf and Bernáth, Attila and Vizer, Máté (2015) Regular graphs are antimagic. The Electronic Journal of Combinatorics, 22 (3). #P3.34. ISSN 1077-8926

Preview

Text 1504.08146v1.pdf Download (369kB) | Preview

Abstract

An undirected simple graph G = (V,E) is called antimagic if there exists an injective function f: E → {1,…|E|} such that (formula presented) 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. © 2015, Australian National University. All rights reserved.

Actions (login required)

Edit Item