Sciweavers

IPL
2010

Antimagic labeling and canonical decomposition of graphs

13 years 2 months ago
Antimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at distinct vertices. Hartsfield and Ringel conjectured that every connected graph other than K2 has an antimagic labeling. We prove this for the classes of split graphs and graphs decomposable under the canonical decomposition introduced by Tyshkevich. Mathematics Subject Classification (2000): 05C78, 05C69, 05C75
Michael D. Barrus
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where IPL
Authors Michael D. Barrus
Comments (0)