Abstract
A labeling of a graph is a bijection from to the set . A labeling is \textit{antimagic} if for any distinct vertices and , the sum of the labels on edges incident to is different from the sum of the labels on edges incident to . We say a graph is antimagic if it has an antimagic labeling. In 1990, Ringel conjectured that every connected graph other than 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.