Edge pair sum labeling of some cycle related graphs

Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*</sup>: V (G) → Z - {0} defined by f*</sup>(v) = ΣP∈</span>Ev</sub> f (e) is one-one where Ev</sub> denotes the set of edges in G that are incident with a vertex v and f*</sup>(V (G)) is either of the form {±k1</sub>,±k2</sub>,...,±kp</sub>/2</sub>} or {±k1</sub>,±k2</sub>,...,±k(p-1)</sub>/2</sub>} U {±k(p+1)</sub>/2</sub>} according as p is even or odd. A graph with an edge pair sum labeling is called an edge pair sum graph. In this paper we prove that the graphs GL(n), double triangular snake D(Tn</sub>), Wn</sub>, Fln</sub>, <Cm</sub>,K1,n and <Cm</sub> * K1,n admit edge pair sum labeling.the formula is not displayed correctly!