On 14-regular distance magic graphs

Result code in IS VaVaI

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

Result on the web

<a href="https://www.ejgta.org/index.php/ejgta/article/view/766/pdf_292" target="_blank" >https://www.ejgta.org/index.php/ejgta/article/view/766/pdf_292</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.5614/ejgta.2024.12.1.4" target="_blank" >10.5614/ejgta.2024.12.1.4</a>

Result language

angličtina

Original language name

On 14-regular distance magic graphs

Original language description

Let G be a graph with n vertices. By N(v) we denote the set of all vertices adjacent to v. A bijection f : V(G) -&gt; {1, 2, ... , n} is a distance magic labeling of G if there exists an integer k such that the sum of labels of all vertices adjacent to v is k for all vertices v in V(G). A graph which admits a distance magic labeling is a distance magic graph. In this paper, we completely characterize all orders for which a 14 -regular distance magic graph exists. Hereby we extended similar results on 2-, 4-, 6-, 8-, 10-, and 12 -regular distance magic graphs.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10102 - Applied mathematics

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2024

Confidentiality

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

Name of the periodical

Electronic Journal of Graph Theory and Applications

ISSN

2338-2287

e-ISSN

—

Volume of the periodical

12

Issue of the periodical within the volume

1

Country of publishing house

ID - INDONESIA

Number of pages

7

Pages from-to

35-41

UT code for WoS article

001217810700001

EID of the result in the Scopus database

—