On regular handicap graphs of even order

Dalibor Fronček; Petr Kovář; Tereza Kovářová; Bohumil Krajc; Michal Kravčenko; Aaron Shepanik; Adam Silber

doi:10.1016/j.endm.2017.06.010

On regular handicap graphs of even order

Dalibor Fronček, Petr Kovář, Tereza Kovářová, Bohumil Krajc, Michal Kravčenko, Aaron Shepanik, Adam Silber

Mathematics & Statistics

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

3 Scopus citations

Abstract

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.

Original language	English (US)
Pages (from-to)	69-76
Number of pages	8
Journal	Electronic Notes in Discrete Mathematics
Volume	60
DOIs	https://doi.org/10.1016/j.endm.2017.06.010
State	Published - Jul 2017

Keywords

Graph labeling
handicap labeling
regular graphs

Access

10.1016/j.endm.2017.06.010

Fingerprint Dive into the research topics of 'On regular handicap graphs of even order'. Together they form a unique fingerprint.

Cite this

@article{fcad1ddb90724c4d91690534dc1472ce,

title = "On regular handicap graphs of even order",

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

keywords = "Graph labeling, handicap labeling, regular graphs",

author = "Dalibor Fron{\v c}ek and Petr Kov{\'a}{\v r} and Tereza Kov{\'a}{\v r}ov{\'a} and Bohumil Krajc and Michal Krav{\v c}enko and Aaron Shepanik and Adam Silber",

year = "2017",

month = jul,

doi = "10.1016/j.endm.2017.06.010",

language = "English (US)",

volume = "60",

pages = "69--76",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

}

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 -