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} defi ned by f*(v) = ΣP∈Evf (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, <Cm,K1,n> and <Cm * K1,n> admit edge pair sum labeling.
Jeyanthi, P., & Saratha Devi, T. (2016). Edge pair sum labeling of some cycle related graphs. Journal of Algorithms and Computation, 48(1), 57-68. doi: 10.22059/jac.2016.7940
MLA
P. Jeyanthi; T. Saratha Devi. "Edge pair sum labeling of some cycle related graphs". Journal of Algorithms and Computation, 48, 1, 2016, 57-68. doi: 10.22059/jac.2016.7940
HARVARD
Jeyanthi, P., Saratha Devi, T. (2016). 'Edge pair sum labeling of some cycle related graphs', Journal of Algorithms and Computation, 48(1), pp. 57-68. doi: 10.22059/jac.2016.7940
VANCOUVER
Jeyanthi, P., Saratha Devi, T. Edge pair sum labeling of some cycle related graphs. Journal of Algorithms and Computation, 2016; 48(1): 57-68. doi: 10.22059/jac.2016.7940
)