On edge–magic disconnected graphs
SUT Journal of Mathematics · 2002
DOI: 10.55937/sut/1057898710 ↗Kurz gefasst
Fachartikel in der Zeitschrift SUT Journal of Mathematics, 2002. Verfasst von Jaroslav Ivančo und 1 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 11 Literaturangaben.
Abstract (Originalsprache)
A graph G is called edge-magic if it admits a labeling of the vertices and edges by pairwise different integers of 1,2,...,|V(G)|+|E(G)| such that the sum of the label of an edge and the labels of its endpoints is constant independent of the choice of edge. A construction of edge-magic labelings of some disconnected graphs is described. Some edge-magic forests are characterized.
Zitieren
APA
Ivančo, J., & Lučkaničová, I. (2002). On edge–magic disconnected graphs. SUT Journal of Mathematics. https://doi.org/10.55937/sut/1057898710
Vancouver
Ivančo J, Lučkaničová I. On edge–magic disconnected graphs. SUT Journal of Mathematics. 2002. doi:10.55937/sut/1057898710
BibTeX
@article{Ivano2002,
author = {Ivančo, Jaroslav and Lučkaničová, Iveta},
title = {On edge–magic disconnected graphs},
journal = {SUT Journal of Mathematics},
year = {2002},
doi = {10.55937/sut/1057898710}
}
EUVIMED