Integrated Intelligent Research (IIR) International Journal of Computing Algorithm

Volume 02, Issue 02, December 2013, Page No.83-85

ISSN: 2278-2397

Pair Sum Labeling Of Some Special Graphs

K. Manimekalai1, K.Thirusangu2
1
Department of Mathematics, Bharathi women’s College (Autonomous), Chennai
2
Department of Mathematics, S.I.V.E.T College, Gowrivakkam, Chennai
Email: manimekalai2010@yahoo.com

Abstract - Let G be a (p, q) graph. A one-one map f : V(G)  Definition 1.6: Take k paths of length l1,l2, l3, . . . ,lk, where k ≥ 3
{1, 2, …, p} is said to be a pair sum labeling if the induced and li =1 forat most one i. Identify their end points to form a
new graph. The new graph is called a generalized theta graph,
edge function, fe : E(G)  Z – {0} defined by f e(uv) = f(u) + and is denoted by Ѳ(l1,l2, l3, . . . ,lk). In other words, Ѳ(l1,l2, l3, . . . ,lk)
f(v) is one-one and fe(E(G)) is either of the form {k1, k2, …, consists k ≥ 3 pair wise internally disjoint paths of length l 1,l2,
kq/2} or {k1, k2, …, k(q1)/2}  {k(q+1)/2} according as q is l3, . . . ,lkthat share a pair of common end points u and v. If each li
even or odd. Recently, the pair sum labeling is introduced by (i = 1,2, . . . ,k) is equal to l, we will write Ѳ(l [k]).
In [3], R.Ponraj and J. V. X. Parthipan have proved the
R.Ponraj, J. V. X. Parthipan. In this paper we study about the following results which we will use in the proof of our
pair sum labeling of coconut tree CT(m, n), the the Y-tree Yn+1, theorem.
Jelly fish J(m, n), (m, 2)-kite, (m, 1)-kite and the theta graph
Ѳ(l[m] ), for m even. Theorem 1.1 (as Theorem 3.9 in [3]): (3, 1) - kite is not a pair
sum graph.
Keywords: pair sum labeling, pair sum graph, AMS
Theorem 1.2[2]: The complete bipartite graphs K1,n and K2,n are
Classification: 05C78.
pair sum graphs.
I. INTRODUCTION
II. MAIN RESULTS
The graph considered here are all finite, undirected and simple.
V(G) and E(G) denote the vertex set and edge set of a graph G. Theorem 2.1: The (m, 2)-kite is a pair sum graph for all m  3.
The pair sum labeling is introduced in [3] by R. Ponraj and et Proof: Let V be the vertex set and E be the edge set of (m, 2)-
al. In [3],[4] [5] and [6] they study the pair sum labeling of kite. Then |V| = |E| = m + 2. We consider the following two
cycle, path, star and some of their related graphs like B m,n, cases.
K1,n K1,m, Pm K1,n, CnCn etc. In this paper we study pair
Case1: m is even. Let m = 2r.
sum labeling of coconut tree CT(m, n), the the Y-tree Yn+1,
Jelly fish J(m, n) , (m, 2)-kite, (m, 1)-kite and the theta graph Let V = {ui, vi / 1 i r}  {w1 , w2 } and E = {uiui+1 , vivi+1 / 1
i r-1}  { urv1 , vru1 , ur w1 , w1w2 } .
[ ]
Ѳ(l[m] ), for m even. Let x be any real number, then x denotes Define a map f : V  {1, 2, …, (2r+2) } as follows:
the largest integer less than or equal to x. Terms and f(ui) = 2i ; 1 i r-1
terminology as in Harary [2]. f(vi) =  f(ui) ; 1 i r-1
f(ur) = 1, f(vr) = 1, f(w1) =  (r+1), f(w2) = (2r+1).
Definition 1.1 [3]. Let G(V, E) be a (p, q) graph. A one-one Then f is a pair sum labeling.
function f : V(G)  {1, 2, …, p} is said to be a pair sum
labeling if the induced edge function fe : E(G)  Z  {0} Case2: m is odd.
defined by fe(uv) = f(u) + f(v) is one-one and f e(E(G)) is either Subcase 2.1: m  9
of the form {k1, k2, …, kq/2} or {k1, k2, …, k(q1)/2}  Let m = 2r+1 , r  4.
{k(q+1)/2} according as q is even or odd. A graph with a pair Let V = {ui / 1 i r}  { vi / 1 i r+1}  { w1 , w2 }
sum labeling defined on it is called a pair sum graph. and E = {uiui+1 / 1 i r-1}  {vivi+1 / 1 i r}  { urv1 , vr+1u1 ,
vr w1 , w1w2 } .
Definition 1.2: A coconut Tree CT(m,n) is the graph obtained
from the path Pm by appending n new pendent edges at an end Define f : V  {1, 2, …, (2r+3) } as follows:
vertex of Pm . f(ui) = 2i ; 1 i r-1
Definition 1.3: A Y-tree Yn+1.is a graph obtained from the path f(vi) =  f(ui) ; 1 i r-2
Pn by appending an edge to a vertex of the path Pmadjacent to f(ur) = 2r1, f(vr-1) = 2r3, f(vr) = (2r2), f(vr+1) = (2r1)
an end point.
f(w1) =  (2r5), f(w2) = 2r+3.
Definition 1.4: An (n, t)-kite is a cycle of length n with a t-edge
path (the tail) attached to one vertex. In particular, the (n, 1)- Subcase 2.2: form = 3, 5 and 7, a pair sum labeling of (m,2)-
kite is a cycle of length n with an edge attached to one vertex. kite is given in Figure 1. Hence the (m, 2)-kite is a pair sum
(n, 1)-kite is also known as flag, Fℓn. graph for all m  3.

Definition 1.5:The Jelly fish graph J(m, n) is obtained from a Corollary 2.2: By deleting the pendant vertex in the (m,2)-kite
4- cycle v1, v2, v3, v4 by joining v1 and v3 with an edge and of the proof of the Theorem 2.1 and by Theorem 1.1, the (m,
appending m pendent edges to v2 and n pendent edges to v4. 1)-kite is a pair sum graph except for m = 3.
1
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume 02, Issue 02, December 2013, Page No.83-85
ISSN: 2278-2397

{2(i+1)
f (u i )=
1
; 1≤i≤r−1
; i= r.
f (v )={
−2i ; 1≤i≤ r
i
−1 ; i = r+1

{
2 ; i=1
f (wi )= 7 ; i=2
−(2i+1) ; 3≤i≤n

Case 2: m  4.

Theorem 2.3:The coconut tree CT(m, n) is a pair sum graph. Subcase 2.1: m =1, then G = CT(1,n) is the star K 1,n. By
Proof: Let G(V,E) = CT(m, n). Then |V(G)| = m + n and |E(G)| Theorem 1.2 [2], G is a pair sum graph.
= m + n-1
Case 1: m  5 Subcase 2.2: m =2, then G = CT(2,n) is the star K 1,n+1. By
Theorem 1.2 [2], it is a pair sum graph.
Subcase 1.1: m is even. Let m = 2r.
Subcase 2.3: m =3, then G = CT(3,n).
Then V(G) = {ui, vi / 1 i r}  {wi / 1 i n} and Let V(G) = {vi / 1 i 3}  {wi / 1 i n} and E(G) = {v1v2 ,
E(G) = {urv1 , uiui+1 , vivi+1 / 1 i r-1}  {wi / 1 i n} v2v3}  {v3wi / 1 i n}

Label the vertices v1, v2 and v3 by -3,2 and -1 respectively.

{
Example 2.1:In Figure 2, pair sum labeling of (16,2)-kite and −(i+1) ; i odd
(17,2)-kite are illustrated. f (wi )=
For 1 in , define
(i+2) ; i even

Subcase 2.4: m=4 then G = CT(4,n).

V(G) = {vi /1 i 4}{wi / 1 i n and E(G) = {v1v2 , v2v3,
v3v4}  {v4wi / 1 i n}. Label the vertices v1, v2 ,v3 and v4 by -

f(wi)=¿{4 ;i=1 ¿{−1 ;i=2¿{−3 ;i=3¿{i−1 ;4≤i n&iev n ¿ ¿

2,-4, 1 and 2 respectively.

For 1 in, define

Then f is a pair sum labeling.Hence the coconut tree CT(m, n)

is a pair sum graph.

Example 2.2: In Figure 3 we give a pair sum labeling of

Define f : V  {1, 2, …, (2r+n) } as follows: CT(4,7).
f(u1) = -3, f(ur) = 1, f(vr) =  1
f(ui) = 2i ; 2i r-1

{
f(vi) =  f(ui) ; 71 i r-1; i=1
f (wi )= −(2i+3 ) ; 2≤i≤n & i even
(2i+3 ) ; 3≤i≤n & i odd

Subcase 1.2: m is odd. Let m = 2r+1.

Then V(G) = {ur+1 , ui, vi / 1 i r}  {wi / 1 i n} and
E(G) = {uiui+1 , urv1 , vrvr+1 , vivi+1 / 1 i r-1}  {vr+1wi / 1 i
n}

Define f : V(G)  {1, 2, …, (2r+n+1) } as follows: Corollary 2. 4: For r  3, the Y–tree Yr+1 is a pair sum graph.

2
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume 02, Issue 02, December 2013, Page No.83-85
ISSN: 2278-2397

Theorem 2.6: For m even, the theta graph Ѳ (l [m] ) is a pair sum
graph.

Proof: Let G(V,E) = Ѳ (l [m] ). Then |V(G)| = m( l- 1) +2 and |

E(G)| = ml.
Let V(G) = V1 V2 where
V 1 ={ui,j ,v i,j|1≤i≤m/ 2 and 1≤ j ≤l-1 }
,
V 2 ={ u, v } and
Proof: We caneasily observe thatY r+1 CT(r-1,2) for r  3. G) = E1 E2 where
Hence by Theorem 2.1 , Yr+1 is a pair sum graph. E(
E1 ={u i,j u i,j+1 ,v i,j v i,j+1 /1≤i≤m/2 and 1≤ j≤l-2 }
Example 2.3: In Figure, 4 a pair sum labeling of Y 4+1 and Y5+1
,
are illustrated
E2 ={uu i,1 ,u v i,l-1 ,v v i,1 ,v ui,l-1 /1≤i≤m / 2 }
Theorem 2.5: For m, n ≥1, Jelly fish graph J(m, n) is a pair sum .
graph. Define a map f : V(G)  {1, 2, …,  m( l- 1) +2} as
follows:
Proof: Let G(V,E) = J(m, n). Then G has (m+n+4) vertices f(u) = 1, f(v) =  1,
and (m+n+5) edges. f(ui,j) = 2( lii+ j  l+ 1); 1 i m/2 & 1  j  l-1
f(vi,j) = f(ui.j) ); 1 i m/2 & 1  j  l-1
Let n ≥ m. Let V(G) = V1 V2 where V1 = {x, u, y, v}, V2 =
{ ui, vj ; 1 i m , 1 i n } and E = E1 E2 ,where E1 = {xu, Clearly f is a pair sum labeling.Hence the theta graph Ѳ (l[m] ) is
uy, yv, vx, xy } , E2 = {uui, vvj ; 1 i m , 1  j  n }. a pair sum graph for m even.

Define f : V  {1, 2, …, (m+n+4) } as follows:

Label the vertices x, u, y, v by -5, -1, 3 and 1 respectively.

{
Define 5 ; i=1
f (v i )= 2(i-1) ; 2≤i≤4
(i+2) ; 5≤i≤m+1

{
For 2  j  n-m
m+3+( j/2) ; 2≤ j≤m−n & j even
f (v m+ j )=
−(m+5+( j−1)/2) ; 3≤ j≤m−n & j odd
f(ui) = f(vi+1) ; 1i m.
Then f is a pair sum labeling.Hence the Jelly fish graph J(m, n)
is a pair sum graph. Example 2.5:In Figure 6, a pair sum labeling for the theta
graph Ѳ (7[6] ) is exhibited.
Example 2.4:In Figure 5, a pair sum labeling for the Jelly fish
REFERENCES
graph J(4, 7) is exhibited. [1] J.A.Gallian, A dynamic survey of graph labeling, The Electronic Journal
of Combinatorics,14 DS6 (2009).
[2] F.Harary, “Graph Theory”, Narosa Publishing House, New Delhi, India,
(1998).
[3] R.Ponraj, J. V. X. Parthipan, “ Pair Sum Labeling of Graphs”, The
Journal of Indian Academy of Mathematics, Vol. 32, No. 2, pp. 587-595,
2010.
[4] R.Ponraj, J. V. X. Parthipan and R. Kala, “Some Results on Pair Sum
Labeling”,International Journal of Mathematical Combinatorics, Vol. 4,
pp. 55-61, 2010.
[5] R.Ponraj, J. V. X. Parthipan and R. Kala, “A Note on Pair Sum Graphs”,
Journal of Scientific Research, Vol. 3, No. 2, pp. 321-329, 2011.
[6] R.Ponraj, J. V. X. Parthipan, Further Results on Pair Sum Labeling of
Trees, Applied Mathematics, 2, 1270-1278, 2011.

Next we will prove that the theta graph Ѳ (l[m] ) is a pair sum
graph , for m even.