Antimagic Labeling of Cubic Graphs
Yu‐Chang Liang, Xuding Zhu · Journal of Graph Theory · 2013
An antimagic labeling of a graph G is a one-to-one correspondence between and 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.