A graph with a pair sum labeling defined on it is called a pair sum graph. Obtained from the path Pm by appending n new pendent edges at an end vertex of Pm, the path Pn by appending an edges to a vertex of the path Pm adjacent to an end point Let Gbe a (p, q) graph. A Injective map g :V(G)→ {±1,±2…±p} is called a pair sum labeling if the induced edge function ge:E(G)→Z-{0} defined by ge(uv)=g(u)+g(v) is one-one and ge(E(G)) is either of the form {±k1,±k2,…,±kq/2} or {±k1,±k2,…,±kq-1/2}{kq+1/2} according as q is even or odd.