On the Existence of Regular Supermagic Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F09%3A00021340" target="_blank" >RIV/61989100:27240/09:00021340 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the Existence of Regular Supermagic Graphs
Original language description
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels at every vertex is independent of the particular vertex. We deal with the existence of regular graphs of orer n.Some constructions of supermagic labelings of regular graphs are psesented.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
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
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing
ISSN
0835-3026
e-ISSN
—
Volume of the periodical
71
Issue of the periodical within the volume
1
Country of publishing house
CA - CANADA
Number of pages
17
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—