Edge pair sum labeling of some cycle related graphs

Let G be a (p,q) graph. An injective map f : E(G) ! f1;2; ... ;qg is said to be an edge pair sum labeling if the induced vertex function f : V (G) ! Z 􀀀 f0g de- ned by f(v) = P eEv f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f(V (G)) is either of the form n k1;k2; ... ;kp 2 o or n k1;k2; ... ;kp􀀀1 2 o Sn kp+1 2 o 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), Wn, Fln, hCm;K1;ni and hCm K1;ni admit edge pair sum labeling.