Mathematics
Handicap distance antimagic graphs and incomplete tournaments
D. Froncek
2013.8.1AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS
tlooto Summary
Graphs are labeled with numbers such that the sum of the distances between adjacent vertices equals a constant value.
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,
Citation format
FRONCEK, D. Handicap distance antimagic graphs and incomplete tournaments. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2013, 10: 119–127.