Handicap distance antimagic graphs and incomplete tournaments

By D. Froncek. 2013

55 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/a02df075aabb9f204d5c18945e99ef30336f918e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Joseph A. Gallian

Citations in the corpus

• A Dynamic Survey of Graph Labeling (2009, background): “In [720] and [722] Froncek proved that disjoint copies of the Cartesian product of two complete graphs and its complement are (a, 2)-distance antimagic and (a, 1)-distance antimagic.”