Regular Bipartite Graphs of Odd Degree are Antimagic
No Thumbnail Available
Date
2013-06
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
Abstract
A labeling of a graph G is an assignment of integers to the edges,vertices or both edges
and vertices of a graph subject to certain conditions. A vertex-sum for a labeling is
the sum of the labels on edges incident to a vertex v. In this work we focus on
edge labeling. A labeling is antimagic if there is a bijection from the edges of G to
f1; 2; jEjg such that the sum of the labels incident to each vertex is distinct. We
say a graph is antimagic if it has an antimagic labeling
The aim of this work is to construct an antimagic labeling for regular bipartite
graph of odd degree. Our proof technique relies mostly on the Marriage Theorem
Description
Keywords
Regular Bipartite Graphs of Odd Degree