On super edge-magic total labeling on subdivision of trees

Abstract

An edge-magic total labeling of a graph G is a one-toone map A from V(G) ∪ E(G) onto the integers {1,2, ..., |V(G) ∪ E(G)|} with the property that, there is an integer constant c such that λ(x) + λ(x, y) + λ(y) = c for any (x, y) ⋯ E(G). If λ(V(G)) = {1,2, ..., |V (G|) then edge-magic total labeling is called super edgemagic total labeling. In this paper we formulate super edge-magic total labeling on subdivision of some families of trees namely: K_1,4and w-tree.