On vertex in-out-antimagic total digraphs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F24%3A10257252" target="_blank" >RIV/61989100:27240/24:10257252 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.webofscience.com/wos/woscc/full-record/WOS:001325842500001" target="_blank" >https://www.webofscience.com/wos/woscc/full-record/WOS:001325842500001</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.disc.2023.113758" target="_blank" >10.1016/j.disc.2023.113758</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On vertex in-out-antimagic total digraphs

Popis výsledku v původním jazyce

A vertex in-out-antimagic total labeling of a directed graph (digraph) D = (V, A) with n vertices and m arcs is a bijection from the set V boolean OR A to the set of integers {1, 2, ... , m +n} such that all n vertex in-weights are pairwise distinct and simultaneously all n vertex out-weights are pairwise distinct. The vertex in-weight is the sum of the vertex label and the labels of all incoming arcs and the vertex out-weight is the sum of the vertex label and the labels of all outgoing arcs. In this paper we provide a general way how to label dense digraphs and certain sparse digraphs. Further, we add constructions of the labeling for three large infinite classes of digraphs and we conjecture that all digraphs allow such a labeling. (c) 2023 Elsevier B.V. All rights reserved.

Název v anglickém jazyce

On vertex in-out-antimagic total digraphs

Popis výsledku anglicky

A vertex in-out-antimagic total labeling of a directed graph (digraph) D = (V, A) with n vertices and m arcs is a bijection from the set V boolean OR A to the set of integers {1, 2, ... , m +n} such that all n vertex in-weights are pairwise distinct and simultaneously all n vertex out-weights are pairwise distinct. The vertex in-weight is the sum of the vertex label and the labels of all incoming arcs and the vertex out-weight is the sum of the vertex label and the labels of all outgoing arcs. In this paper we provide a general way how to label dense digraphs and certain sparse digraphs. Further, we add constructions of the labeling for three large infinite classes of digraphs and we conjecture that all digraphs allow such a labeling. (c) 2023 Elsevier B.V. All rights reserved.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2024

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

1872-681X

Svazek periodika

347

Číslo periodika v rámci svazku

8

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

6

Strana od-do

—

Kód UT WoS článku

001325842500001

EID výsledku v databázi Scopus

—