Regular graphs are antimagic (Q888592): Difference between revisions

Summary: An undirected simple graph \(G=(V,E)\) is called antimagic if there exists an injective function \(f:E\to\{1,\dots,|E|\}\) such that \(\sum_{e\in E(u)} f(e)\neq\sum_{e\in E(v)} f(e)\) for any pair of different nodes \(u,v\in V\). In this note we prove -- with a slight modification of an argument of \textit{D. W. Cranston} et al. [J. Graph Theory 80, No. 1, 28--33 (2015; Zbl 1321.05229)] -- that \(k\)-regular graphs are antimagic for \(k\geq 2\).