SEARCH

SEARCH BY CITATION

Keywords:

  • antimagic labeling;
  • cubic graphs

Abstract

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.