TLet G(V,E) be a simple, connected and undirected graph with n vertices and
m edges. An edge magic total (EMT) labeling is bijection f from V ∪E to a
subset of integers {1,2,?,n+m} such that the weight of every edges are f(u) +
f(v) + f(uv) = k, for some constant k (called magic constant of f). Function f is
called super edge magic total (SEMT) labeling if f is an EMT and f (V) =
{1,2,?,n}. New classes of graph, called cycle-like unicycle and corona-like
unicycle, can be constructed from embedding odd cycle (backbone cycle from
corona) in grid and applying some edge transformation. This final project
shows that those new classes of graph are also SEMT.