(S, D) Magic Labeling of Subdivision of Some Special Trees

Let G (connected, undirected, simple and non-trivial graph with p vertices and q edges. Let f be an injective function f: V(G) } and g be an injective function g: E(G) .Then the graph G is said to be (s, d) magic labeling if is a constant, for all . A graph G is called (magic graphif it admits magic labeling. In this paper the existence of (s, d) magic labeling of subdivision on some special trees are found.