Difference distance magic oriented graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F24%3A10257254" target="_blank" >RIV/61989100:27240/24:10257254 - isvavai.cz</a>
Result on the web
<a href="http://file:///D:/DataProfil/Downloads/s40687-024-00482-7.pdf" target="_blank" >http://file:///D:/DataProfil/Downloads/s40687-024-00482-7.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s40687-024-00482-7" target="_blank" >10.1007/s40687-024-00482-7</a>
Alternative languages
Result language
angličtina
Original language name
Difference distance magic oriented graphs
Original language description
This article introduces difference distance magic (DDM) labelings, a new labeling on oriented graphs. We discuss basic properties of oriented graphs that have a DDM labeling and methods for constructing DDM labelings in a wide variety of oriented graph classes. We also give a variety of oriented graph classes that fail to produce a DDM labeling.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
O - Projekt operacniho programu
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Research in Mathematical Sciences
ISSN
2522-0144
e-ISSN
2197-9847
Volume of the periodical
11
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
18
Pages from-to
—
UT code for WoS article
001347312900001
EID of the result in the Scopus database
—