On cycle-supermagicness of subdivided graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43928292" target="_blank" >RIV/49777513:23520/15:43928292 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1017/S0004972715000325" target="_blank" >http://dx.doi.org/10.1017/S0004972715000325</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1017/S0004972715000325" target="_blank" >10.1017/S0004972715000325</a>

Result language
angličtina
Original language name
On cycle-supermagicness of subdivided graphs
Original language description
Lladó and Moragas showed the cyclic-magic and cyclic-supermagic behaviour of several classes of connected graphs. They discussed cycle-magic labellings of subdivided wheels and friendship graphs, but there are no further results on cycle-magic labellingsof other families of subdivided graphs. In this paper, we find cycle-magic labellings for subdivided graphs. We show that if a graph has a cycle-(super)magic labelling, then its uniform subdivided graph also has a cycle-(super)magic labelling. We also discuss some cycle-supermagic labellings for nonuniform subdivided fans and triangular ladders.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/ED1.1.00%2F02.0090" target="_blank" >ED1.1.00/02.0090: NTIS - New Technologies for Information Society</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)