The irregularity strength of generalized Petersen graphs
Stanislav Jendroľ, Vladimír Žoldák (1995)
Mathematica Slovaca
Similarity:
Displaying similar documents to “Extremal Crossing Numbers of Complete -Chromatic Graphs”
The irregularity strength of generalized Petersen 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 and supermagic line graphs
Jaroslav Ivančo, Z. Lastivková, A. Semaničová (2004)
Mathematica Bohemica
Similarity:
A graph is called magic (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. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.