Log in to see this item in other languages
On magic joins of graphs
A graph is called magic (supermagic) if it admits a labeling 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 this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
Creator
- Ivančo, Jaroslav
- Polláková, Tatiana
Subject
- magic graph
- supermagic graph
- join of graphs
Type of item
- model:article
Creator
- Ivančo, Jaroslav
- Polláková, Tatiana
Subject
- magic graph
- supermagic graph
- join of graphs
Type of item
- model:article
Providing institution
Aggregator
Rights statement for the media in this item (unless otherwise specified)
- http://creativecommons.org/publicdomain/mark/1.0/
Rights
- policy:public
Place-Time
- 459-472
Source
- Mathematica bohemica | 2012 Volume:137 | Number:4
Identifier
- uuid:dcb76365-8cf6-49e6-8445-2ca2ac560099
- https://cdk.lib.cas.cz/client/handle/uuid:dcb76365-8cf6-49e6-8445-2ca2ac560099
- uuid:dcb76365-8cf6-49e6-8445-2ca2ac560099
- doi:10.21136/MB.2012.143000
Format
- bez média
- svazek
Language
- eng
- eng
Providing country
- Czech Republic
Collection name
First time published on Europeana
- 2021-06-01T12:19:28.026Z
Last time updated from providing institution
- 2021-06-01T12:19:28.026Z