ON SUPER EDGE-MAGIC LABELING OF SOME GRAPHS

Title & Authors
ON SUPER EDGE-MAGIC LABELING OF SOME GRAPHS
Park, Ji-Yeon; Choi, Jin-Hyuk; Bae, Jae-Hyeong;

Abstract
A graph G = (V, E) is called super edge-magic if there exists a one-to-one map $\small{\lambda}$ from V $\small{\cup}$ E onto {1,2,3,...,|V|+|E|} such that $\small{\lambda}$(V)={1,2,...,|V|} and $\small{\lambda(x)+\lambda(xy)+\lambda(y)}$ is constant for every edge xy. In this paper, we investigate whether some families of graphs are super edge-magic or not.
Keywords
edge magic labeling;super edge-magic graphs;magic number;
Language
English
Cited by
1.
Onk-edge-magic labelings of maximal outerplanar graphs, AKCE International Journal of Graphs and Combinatorics, 2015, 12, 1, 40
2.
The Jumping Knight and Other (Super) Edge-Magic Constructions, Mediterranean Journal of Mathematics, 2014, 11, 2, 217
3.
On the k-edge magic graphs, Electronic Notes in Discrete Mathematics, 2014, 45, 35
References
1.
H. Enomoto, A. S. Llado, T. Nakamigawa, and G. Ringel, Super edge-magic graphs, SUT J. Math. 34 (1998), no. 2, 105-109

2.
A. Kotzig and A. Rosa, Magic valuations of finite graphs, Canad. Math. Bull. 13 (1970), 451-461

3.
G. Ringel and A. S. Llado, Another tree conjecture, Bull. Inst. Combin. Appl. 18 (1996), 83-85

4.
W. D. Wallis, Magic Graphs, Birkhauser Boston, Inc., Boston, MA, 2001

5.
W. D. Wallis, E. T. Baskoro, M. Miller, and Slamin, Edge-magic total labelings, Australas. J. Combin. 22 (2000), 177-190

6.
D. B. West, Introduction to Graph Theory, Prentice Hall, Inc., Upper Saddle River, NJ, 1996