In: Tatra Mountains Mathematical Publications, vol. 36, no. 2
Andrea Semaničová
Detaily:
Rok, strany: 2007, 121 - 128
Kľúčové slová:
magic graph, supermagic graph, join of graphs, regular
graph, saturated vertex
O článku:
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we characterize magic graphs with saturated vertex and we establish some conditions for magic graphs with saturated vertex to be supermagic.
Ako citovať:
ISO 690:
Semaničová, A. 2007. Magic graphs having a saturated vertex. In Tatra Mountains Mathematical Publications, vol. 36, no.2, pp. 121-128. 1210-3195.
APA:
Semaničová, A. (2007). Magic graphs having a saturated vertex. Tatra Mountains Mathematical Publications, 36(2), 121-128. 1210-3195.