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

Dalibor Froncek

doi:10.7494/OpMath.2017.37.4.557

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

Dalibor Froncek

Mathematics & Statistics

Research output: Contribution to journal › Article › peer-review

7 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(x_i) = i and the sequence of weights w(x₁), w(x₂), . . . , w(x_n) (where w(x_i) = ∑_xixj∈E f(x_j)) 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 language	English (US)
Pages (from-to)	557-566
Number of pages	10
Journal	Opuscula Mathematica
Volume	37
Issue number	4
DOIs	https://doi.org/10.7494/OpMath.2017.37.4.557
State	Published - 2017

Bibliographical note

Publisher Copyright:
© Wydawnictwa AGH, 2017.

Keywords

Distance magic labeling
Handicap labeling.
Handicap tournaments
Incomplete tournaments

Publisher link

10.7494/OpMath.2017.37.4.557

Find It

Find It at U of M Libraries

Cite this

@article{50961429646f45729fb304400984288d,

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

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

keywords = "Distance magic labeling, Handicap labeling., Handicap tournaments, Incomplete tournaments",

author = "Dalibor Froncek",

note = "Publisher Copyright: {\textcopyright} Wydawnictwa AGH, 2017.",

year = "2017",

doi = "10.7494/OpMath.2017.37.4.557",

language = "English (US)",

volume = "37",

pages = "557--566",

journal = "Opuscula Mathematica",

issn = "1232-9274",

publisher = "Akademia Gorniczo-Hutnicza im. S. Staszica w Krakowie.",

number = "4",

}

TY - JOUR

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

AU - Froncek, Dalibor

N1 - Publisher Copyright: © Wydawnictwa AGH, 2017.

PY - 2017

Y1 - 2017

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

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

KW - Distance magic labeling

KW - Handicap labeling.

KW - Handicap tournaments

KW - Incomplete tournaments

UR - http://www.scopus.com/inward/record.url?scp=85019472996&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85019472996&partnerID=8YFLogxK

U2 - 10.7494/OpMath.2017.37.4.557

DO - 10.7494/OpMath.2017.37.4.557

M3 - Article

AN - SCOPUS:85019472996

SN - 1232-9274

VL - 37

SP - 557

EP - 566

JO - Opuscula Mathematica

JF - Opuscula Mathematica

IS - 4

ER -

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

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this