Regular handicap graphs of order n = 4 (mod 8)

Dalibor Froncek, Aaron L Shepanik

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection (Formula presented): V {1, 2,…, n} 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 = 4 (mod 8) for all feasible values of r.

Original languageEnglish (US)
Pages (from-to)259-273
Number of pages15
JournalElectronic Journal of Graph Theory and Applications
Volume10
Issue number1
DOIs
StatePublished - 2022

Bibliographical note

Publisher Copyright:
© 2022. All Rights Reserved.

Keywords

  • graph labeling
  • handicap labeling
  • regular graphs
  • tournament scheduling

Fingerprint

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

Cite this