Handicap Labelings of 4-Regular Graphs

Kód výsledku v 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>

Nalezeny alternativní kódy

RIV/61989100:27740/17:10236024

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

Handicap Labelings of 4-Regular Graphs

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Handicap Labelings of 4-Regular Graphs

Popis výsledku anglicky

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.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

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

Návaznosti

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

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název periodika

Advances in Electrical and Electronic Engineering

ISSN

1336-1376

e-ISSN

—

Svazek periodika

15

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

5

Strana od-do

"331 "- 335

Kód UT WoS článku

000409044400025

EID výsledku v databázi Scopus

2-s2.0-85025579921