TY - JOUR
T1 - Regular handicap graphs of odd order
AU - Froncek, Dalibor
N1 - Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2017/8
Y1 - 2017/8
N2 - A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f : V {l,2,...,n} with the property that f(Xi) = i and the sequence of the weights w(xi), w(i2)......... w(xn) (where w(xi) =ΣjϵN(xj)) forms an increasing arithmetic progression. A graph G is a handicap distance antimagic graph if it allows a handicap distance antimagic labeling. We construct regular handicap distance antimagic graphs for every feasible odd order.
AB - A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f : V {l,2,...,n} with the property that f(Xi) = i and the sequence of the weights w(xi), w(i2)......... w(xn) (where w(xi) =ΣjϵN(xj)) forms an increasing arithmetic progression. A graph G is a handicap distance antimagic graph if it allows a handicap distance antimagic labeling. We construct regular handicap distance antimagic graphs for every feasible odd order.
KW - Distance magic labeling
KW - Handicap labeling
KW - Handicap tournaments
KW - Incomplete tournaments
UR - http://www.scopus.com/inward/record.url?scp=85021404086&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85021404086&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:85021404086
SN - 0835-3026
VL - 102
SP - 253
EP - 266
JO - Journal of Combinatorial Mathematics and Combinatorial Computing
JF - Journal of Combinatorial Mathematics and Combinatorial Computing
ER -