Regular Graphs of Odd Degree Are Antimagic
Daniel W. Cranston, Yu‐Chang Liang, Xuding Zhu · Journal of Graph Theory · 2014
Abstract An antimagic labeling of a graph G with m edges is a bijection from to such that for all vertices u and v, the sum of labels on edges incident to u differs from that for edges incident to v. Hartsfield and Ringel conjectured that every connected graph other than the single edge K2 has an antimagic labeling. We prove this conjecture for regular graphs of odd degree.