%0 Journal Article
%T Edge pair sum labeling of some cycle related graphs
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Jeyanthi, P.
%A Saratha Devi, T.
%D 2016
%\ 11/01/2016
%V 48
%N 1
%P 57-68
%! Edge pair sum labeling of some cycle related graphs
%K Edge pair sum labeling
%K edge pair sum graph
%K double triangular snake
%K wheel graph
%K ower graph
%R 10.22059/jac.2016.7940
%X 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*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev 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 {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} 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, and admit edge pair sum labeling.
%U https://jac.ut.ac.ir/article_7940_56568b68b988fc59429af15e748b7a64.pdf