科研之友
微信
新浪微博
Facebook
分享链接
摘要
An antimagic labeling of a graph G is a one-to-one correspondence between E(G) and {1,2,...,|E|} 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.
