TY - JOUR

T1 - On regular handicap graphs of even order

AU - Fronček, Dalibor

AU - Kovář, Petr

AU - Kovářová, Tereza

AU - Krajc, Bohumil

AU - Kravčenko, Michal

AU - Shepanik, Aaron

AU - Silber, Adam

PY - 2017/7

Y1 - 2017/7

N2 - Let G=(V,E) be a simple graph of order n. A bijection f : V→{1,2,…,n} is a handicap labeling of G if there exists an integer ℓ such that ∑u∈N(v)f(u)=ℓ+f(v) for all v∈V, where N(v) is the set of all vertices adjacent to v. Any graph which admits a handicap labeling is a handicap graph. We present an overview of results, which completely answer the question of existence of regular handicap graphs of even order.

AB - Let G=(V,E) be a simple graph of order n. A bijection f : V→{1,2,…,n} is a handicap labeling of G if there exists an integer ℓ such that ∑u∈N(v)f(u)=ℓ+f(v) for all v∈V, where N(v) is the set of all vertices adjacent to v. Any graph which admits a handicap labeling is a handicap graph. We present an overview of results, which completely answer the question of existence of regular handicap graphs of even order.

KW - Graph labeling

KW - handicap labeling

KW - regular graphs

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

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

U2 - 10.1016/j.endm.2017.06.010

DO - 10.1016/j.endm.2017.06.010

M3 - Article

AN - SCOPUS:85021426448

VL - 60

SP - 69

EP - 76

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

ER -