Regular handicap graphs of odd order

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 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.

Original languageEnglish (US)
Pages (from-to)253-266
Number of pages14
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Volume102
StatePublished - Aug 2017

Keywords

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

Fingerprint

Dive into the research topics of 'Regular handicap graphs of odd order'. Together they form a unique fingerprint.

Cite this