A note on incomplete regular tournaments with handicap two of order n≡8(mod 16)

Citation data:

Opuscula Mathematica, ISSN: 1232-9274, Vol: 37, Issue: 4, Page: 557-566

Publication Year:
2017

No metrics available.

DOI:
10.7494/opmath.2017.37.4.557
Author(s):
Dalibor Froncek
Publisher(s):
AGHU University of Science and Technology Press
Tags:
Mathematics
article description
A d-handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f : V → {1, 2, . . . , n} with the property that f(x) = i and the sequence of weights w(x), w(x), . . . , w(x) (where w(x) = ∑ f(x)) forms an increasing arithmetic progression with common difference d. A graph G is a d-handicap distance antimagic graph if it allows a d-handicap distance antimagic labeling. We construct a class of k-regular 2-handicap distance antimagic graphs for every order n ≡ 8 (mod 16), n ≥ 56 and 6 ≤ k ≤ n - 50.