Antimagic Labeling of Cubic Graphs


  • Grant Numbers: NSF11171310 and ZJNSF Z6110786.


An antimagic labeling of a graph G is a one-to-one correspondence between inline image and inline image such that the sum of the labels assigned to edges incident to distinct vertices are different. If G has an antimagic labeling, then we say G is antimagic. This article proves that cubic graphs are antimagic.