Regular Bipartite Graphs Of Odd Degree Are Antimagic

A labeling of a graph G is an assignment of integers to the edges,vertices or both edgesrnand vertices of a graph subject to certain conditions. A vertex-sum for a labeling isrnthe sum of the labels on edges incident to a vertex v. In this work we focus onrnedge labeling. A labeling is antimagic if there is a bijection from the edges of G tornf1; 2; jEjg such that the sum of the labels incident to each vertex is distinct. Wernsay a graph is antimagic if it has an antimagic labelingrnThe aim of this work is to construct an antimagic labeling for regular bipartiterngraph of odd degree. Our proof technique relies mostly on the Marriage Theorem

Get Full Work

Report copyright infringement or plagiarism