We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Regular handicap tournaments of high degree.
- Authors
Froncek, Dalibor; Shepanik, Aaron
- Abstract
A 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(xi) = i and the sequence of the weights w(x1),w(x2),...,w(xn) (where w(xi) = ... forms an increasing arithmetic progression with difference one. A graph G is a handicap distance antimagic graph if it allows a handicap distance antimagic labeling. We construct (n=7)-regular handicap distance antimagic graphs for every order n = 2 (mod 4) with a few small exceptions. This result complements results by Kovár, Kovárová, and Krajc [P. Kovár, T. Kovárová, B. Krajc, On handicap labeling of regular graphs, manuscript, personal communication, 2016] who found such graphs with regularities smaller than n - 7.
- Subjects
GRAPH theory; GEOMETRIC vertices; MATHEMATICAL sequences; ARITHMETIC series; PERSONAL communication service systems
- Publication
Journal of Algebra Combinatorics Discrete Structures & Applications, 2017, Vol 4, Issue 3, p159
- ISSN
2148-838X
- Publication type
Article
- DOI
10.13069/jacodesmath.22530