Handicap distance antimagic graphs and incomplete tournaments

Abstract

Let G = (V,E) be a graph of order n. A bijection f : V ! {1,2,...,n} is called a distance magic labeling of G if there exists a positive integer µ such that P u2N(v) f(u) = µ for all v 2 V,