| |
|
| This is a preprint of an article accepted for publication in Journal of Graph Theory © Copyright 2005 Wiley Periodicals, Inc., A Wiley Company, http://www.interscience.Wiley.com/ |
|
Abstract: A graph is called supermagic if it admits a labelling of the edges by pairwise different 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 establish some bounds for the number of edges in supermagic graphs. Contact the authors: ivanco@science.upjs.sk, semanic@science.upjs.sk Download PDF version of the preprint. |