On Supermagic Regular Graphs

@inproceedings{Ivanco1997OnSR,
  title={On Supermagic Regular Graphs},
  author={Jaroslav Ivanco and Ko{\vs}ice},
  year={1997}
}
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. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Supermagic complete graphs

  • B. M. Stewart
  • Canad. J. Math
  • 1967
Highly Influential
3 Excerpts

Two classes of super-magic graphs

  • M.Bača, I. Holländer, Ko-Wei Lih
  • J. Combin. Math. Combin. Comput
  • 1997
2 Excerpts

Characterization of magic graphs

  • S. Jezný, M.Trenkler
  • Czechoslovak Math. J
  • 1983
1 Excerpt

Similar Papers

Loading similar papers…