Magic squares and antimagic graphs


An antimagic labeling of a graph with m edges is a bijection λ from its edge set to {1, 2, . . . ,m} such that the vertex sums are distinct, a vertex sum being the sum of the λ-values on the edges incident with the vertex. An antimagic graph is one that admits such a labeling. It was conjectured in [N. Hartsfield and G. Ringel, Supermagic and antimagic… (More)


1 Figure or Table

Slides referencing similar topics