A. A. G. Ngurah

  • Citations Per Year
Learn More
A graph G is called edge-magic if there exists a bijection f : V (G) ∪ E(G) → {1, 2, 3, . . . , |V (G) ∪ E(G)|} 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 edgemagic if f(V (G)) = {1, 2, 3, . . . , |V (G)|}. Furthermore, the edge-magic deficiency of a graph G, μ(G), is defined as the minimum(More)
  • 1