Regular handicap graphs of order n ≡ 0 (mod 8)

Dalibor Froncek, Aaron L Shepanik

Research output: Contribution to journalArticle

Abstract

A handicap distance antimagic labeling of a graph G = (V,E) with n vertices is a bijection f: V → {1, 2, . . ., ng with the property that f(xi) = i, the weight w(xi) is the sum of labels of all neighbors of xi, and the sequence of the weights w(x1),w(x2), . . ., w(xn) forms an increasing arithmetic progression. A graph G is a handicap distance antimagic graph if it allows a handicap distance antimagic labeling. We construct r-regular handicap distance antimagic graphs of order n ≡ 0 (mod 8) for all feasible values of r.

Original languageEnglish (US)
Pages (from-to)208-218
Number of pages11
JournalElectronic Journal of Graph Theory and Applications
Volume6
Issue number2
DOIs
StatePublished - Jan 1 2018

Keywords

  • Graph labeling
  • Handicap labeling
  • Regular graphs
  • Tournament scheduling

Fingerprint Dive into the research topics of 'Regular handicap graphs of order n ≡ 0 (mod 8)'. Together they form a unique fingerprint.

  • Cite this