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

preprint2007arXivOpen access

Abstract

A labeling of a graph is a bijection from E(G)E(G) to the set {1,2,...,∣E(G)∣}\{1, 2,..., |E(G)|\}. A labeling is \textit{antimagic} if for any distinct vertices uu and vv, the sum of the labels on edges incident to uu is different from the sum of the labels on edges incident to vv. We say a graph is antimagic if it has an antimagic labeling. In 1990, Ringel conjectured that every connected graph other than K2K_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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.