Antimagic labelings of regular bipartite graphs: An application of the Marriage Theorem

arXiv0708.2776MaRDI QIDQ6206543FDOQ6206543

Authors: Daniel W. Cranston 

Publication date: 21 August 2007

Abstract: A labeling of a graph is a bijection from $E(G)$ to the set $1,2,\mathrm{...},|E(G)|$. A labeling is extit{antimagic} if for any distinct vertices $u$ and $v$, the sum of the labels on edges incident to $u$ is different from the sum of the labels on edges incident to $v$. We say a graph is antimagic if it has an antimagic labeling. In 1990, Ringel conjectured that every connected graph other than $K_2$ is antimagic. In this paper, we show that every regular bipartite graph (with degree at least 2) is antimagic. Our technique relies heavily on the Marriage Theorem.

This page was built for publication: Antimagic labelings of regular bipartite graphs: An application of the Marriage Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6206543)