On super (a,1)-edge-antimagic total labelings of regular graphs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A10224310" target="_blank" >RIV/61989100:27240/10:10224310 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On super (a,1)-edge-antimagic total labelings of regular graphs

Popis výsledku v původním jazyce

A labeling of a graph is a mapping that carries some set of graph elements into numbers (usually positive integers). An (a,d)-edge-antimagic total labeling of a graph with p vertices and q edges is a one-to-one mapping that takes the vertices and edges onto the integers 1,2?,p+q, so that the sum of the labels on the edges and the labels of their end vertices forms an arithmetic progression starting at a and having difference d. Such a labeling is called super if the p smallest possible labels appear atthe vertices. In this paper we prove that every even regular graph and every odd regular graph with a 1-factor are super (a,1)-edge-antimagic total. We also introduce some constructions of non-regular super (a,1)-edge-antimagic total graphs.

Název v anglickém jazyce

On super (a,1)-edge-antimagic total labelings of regular graphs

Popis výsledku anglicky

A labeling of a graph is a mapping that carries some set of graph elements into numbers (usually positive integers). An (a,d)-edge-antimagic total labeling of a graph with p vertices and q edges is a one-to-one mapping that takes the vertices and edges onto the integers 1,2?,p+q, so that the sum of the labels on the edges and the labels of their end vertices forms an arithmetic progression starting at a and having difference d. Such a labeling is called super if the p smallest possible labels appear atthe vertices. In this paper we prove that every even regular graph and every odd regular graph with a 1-factor are super (a,1)-edge-antimagic total. We also introduce some constructions of non-regular super (a,1)-edge-antimagic total graphs.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2010

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

Discrete Mathematics

ISSN

0012-365X

e-ISSN

—

Svazek periodika

310

Číslo periodika v rámci svazku

9

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

5

Strana od-do

—

Kód UT WoS článku

000276731900002

EID výsledku v databázi Scopus

—