%0 Journal Article
%T Edge pair sum labeling of spider graph
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Jeyanthi, P.
%A Saratha Devi, T.
%D 2014
%\ 11/20/2014
%V 45
%N 1
%P 25-34
%! Edge pair sum labeling of spider graph
%K Edge pair sum labeling
%K edge pair sum graph
%K spider graph
%R 10.22059/jac.2014.7918
%X An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex 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 which admits edge pair sum labeling is called an edge pair sum graph. In this paper we exhibit some spider graph.
%U https://jac.ut.ac.ir/article_7918_d0a0b362799482703ea6296c4b91f013.pdf