Handicap Labelings of 4-Regular Graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F17%3A10236024" target="_blank" >RIV/61989100:27240/17:10236024 - isvavai.cz</a>

Alternative codes found

RIV/61989100:27740/17:10236024

Result on the web

<a href="http://advances.utc.sk/index.php/AEEE/article/view/2263" target="_blank" >http://advances.utc.sk/index.php/AEEE/article/view/2263</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.15598/aeee.v15i2.2263" target="_blank" >10.15598/aeee.v15i2.2263</a>

Result language

angličtina

Original language name

Handicap Labelings of 4-Regular Graphs

Original language description

Let G be a simple graph, let f : V (G) -&gt; {1, 2,..., |V (G)|} be a bijective mapping. The weight of v ∈ V(G) is the sum of labels of all vertices adjacent to v. We say that f is a distance magic labeling of G if the weight of every vertex is the same constant k and we say that f is a handicap magic labeling of G if the weight of every vertex v is l+f(v) for some constant l. Graphs that allow such labelings are called dis- tance magic or handicap, respectively. Distance magic and handicap labelings of regular graphs are used for scheduling incomplete tournaments. While distance magic labelings correspond to so called equalized tour- naments, handicap labelings can be used to schedule ncomplete tournaments that are more challenging to stronger teams or players, hence they increase competition and yield attractive schemes in which every game counts. We summarize known results on distance magic and handicap labelings and construct a new infinite class of 4-regular handicap graphs.

Czech name

—

Czech description

—

Type

J_SC - Article in a specialist periodical, which is included in the SCOPUS database

CEP classification

—

OECD FORD branch

10102 - Applied mathematics

Project

<a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Advances in Electrical and Electronic Engineering

ISSN

1336-1376

e-ISSN

—

Volume of the periodical

15

Issue of the periodical within the volume

2

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

5

Pages from-to

"331 "- 335

UT code for WoS article

000409044400025

EID of the result in the Scopus database

2-s2.0-85025579921