On Super Edge Magic and Bimagic Labeling for Duplication Graphs

An edge magic total labeling of a graph G(V, E) with p vertices and q edges is a bijection f : V(G) U E(G) → {1, 2, ..., p+q} such that for every edge uv in E, f(u) + f(uv) + f(v) is a constant k. If there exist two constants k1 and k2 such that the above sum is either k1 or k2, it is said to be an edge bimagic total labeling. In this paper we study and investigate super edge magic and bimagic labeling for duplication graphs of cycles and paths.