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

A \(d\)-handicap distance antimagic labeling of a graph \(G=(V,E)\) with \(n\) vertices is a bijection \(f:V\to \{1,2,\ldots ,n\}\) with the property that \(f(x_i)=i\) and the sequence of weights \(w(x_1),w(x_2),\ldots,w(x_n)\) (where \(w(x_i)=\sum_{x_i x_j\in E}f(x_j)\)) forms an increasing arithm...

Full description

Bibliographic Details
Main Author: Dalibor Froncek
Format: Article
Language:English
Published: AGH Univeristy of Science and Technology Press 2017-01-01
Series:Opuscula Mathematica
Subjects:
Online Access:http://www.opuscula.agh.edu.pl/vol37/4/art/opuscula_math_3728.pdf