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

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

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(xi) = i and the sequence of weights w(x1), w(x2), . . . , w(xn) (where w(xi) = ∑xixj∈E f(xj)) 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.

Original languageEnglish (US)
Pages (from-to)557-566
Number of pages10
JournalOpuscula Mathematica
Volume37
Issue number4
DOIs
StatePublished - Jan 1 2017

Keywords

  • Distance magic labeling
  • Handicap labeling.
  • Handicap tournaments
  • Incomplete tournaments

Fingerprint Dive into the research topics of 'A note on incomplete regular tournaments with handicap two of order n ≡ 8 (mod 16)'. Together they form a unique fingerprint.

  • Cite this