Regular graphs are antimagic
Abstract
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)≠Σe∈ E(v) f(e) for any pair of different nodes u,v∈ V. In a previous version of the paper, the authors gave a proof that regular graphs are antimagic. However, the proof of the main theorem is incorrect as one of the steps uses an invalid assumption. The aim of the present erratum is to fix the proof.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.