A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

Let G be a (p, q) graph. A one-one map f: V (G)→{±1,±2,…,±p} is said to be a pair sum
labeling if the induced edge function, fe: E (G)→ Z–{0} defined by fe (uv)= f (u)+ f (v) is one …

An injective map f: E (G)→ is said to be an edge pair sum labeling of a graph G (p, q) if the
induced vertex function defined by is one–one, where denotes the set of edges in G that are …

Let G be a graph with P vertices and q edges. The graph G is said to be a super pair sum
labeling if there exists a bijection f from when p+ q is odd and from when p+ q is even such …

Further Results on Pair Sum Labeling of Trees Page 1 Applied Mathematics, 2011, 2, 1270-1278
doi:10.4236/am.2011.210177 Published Online October 2011 (http://www.SciRP.org/journal/am) …

Let G=(V, E) be a graph with p-vertices and q-edges and let R◦ be a finite zero ring of order
n. An injective function f: V (G)→{r1, r2,..., rk}, where ri∈ R◦ is called vertex pair sum k-zero …

Available online at http://scik.org J. Math. Comput. Sci. 2 (2012), No. 3, 747-758 ISSN: 1927-5307
Page 1 ________ *Corresponding author E-mail addresses: ponrajmaths@indiatimes.com (R.Ponraj) …

For a (p, q) graph G, an injective map f from V (G) to {±1,±2,...,±p} is said to be a pair sum
labeling if the induced edge function f< sub> e from E (G) to {nm-0} defined by f< sub> …

The graphs considered here will be finite, undirected and simple. and will denote the vertex
set and edge set of a graph G. The cardinality of the vertex set of a graph G is denoted by p …

Let $ G $ be a graph with $ p $ vertices and $ q $ edges. The graph $ G $ is said to be a
super pair sum labeling if there exists a bijection $ f $ from $ V (G)\cup E (G) $ to $\{0,\pm …