- Full text PDF available (1)

Learn More

- A. A. G. Ngurah, Edy Tri Baskoro, Rinovia Simanjuntak
- Australasian J. Combinatorics
- 2008

A graph G is called edge-magic if there exists a bijection f :|} such that f (x) + f (xy) + f (y) is a constant for every edge xy ∈ E(G). A graph G is said to be super edge-magic if f (V (G)) = {1, 2, 3,. .. , |V (G)|}. Furthermore, the edge-magic deficiency of a graph G, µ(G), is defined as the minimum nonnegative integer n such that G∪nK 1 is edge-magic.… (More)

- ‹
- 1
- ›