On distances in some bipartite graphs.
Gutman, Ivan (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “On magic and supermagic line graphs”
On distances in some bipartite graphs.
On supermagic regular graphs
Jaroslav Ivančo (2000)
Mathematica Bohemica
Similarity:
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. Some constructions of supermagic labellings of regular graphs are described. Supermagic regular complete multipartite graphs and supermagic cubes are characterized.
On magic joins of graphs
Jaroslav Ivančo, Tatiana Polláková (2012)
Mathematica Bohemica
Similarity:
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.