(S,d)Magic Labeling of Some Trees

Abstract

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 graph if it admits  magic labeling. In this paper the existence of (s, d) magic labeling in some trees such as a Coconut tree, Regular bamboo tree, Symmetrical tree, Olive tree, Spider graph are found.