Abstract
For a graph , a bijection from to is called an edge-magic labeling of if is independent on the choice of the edge . An edge-magic labeling is called super edge-magic if . A graph is called edge-magic (resp. super edge-magic) if there exists an edge-magic (resp. super edge-magic) labeling of . In this paper, we investigate whether several families of graphs are (super) edge-magic or not. We also give several conjectures.
Citation
Hikoe Enomoto. Anna S. Llado. Tomoki Nakamigawa. Gerhard Ringel. "SUPER EDGE-MAGIC GRAPHS." SUT J. Math. 34 (2) 105 - 109, June 1998. https://doi.org/10.55937/sut/991985322
Information