Portal de Periódicos da CAPES

Pair Sum Labeling of some Special Graphs

2013; Volume: 69; Issue: 8 Linguagem: Inglês

10.5120/11863-7647

0975-8887

K. Manimekalai, K. Thirusangu,

Graph Labeling and Dimension Problems

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, f e : E(G)  Z -{0} defined by f e (uv) = f(u) + f(v) is one-one and f e (E(G)) is either of the form {k 1 , k 2 , …, k q/2 } or {k 1 , k 2 , …, k (q1)/2 }  {k (q+1)/2 } according as q is even or odd.Recently, the pair sum labeling was introduced by R.Ponraj, J. V. X. Parthipan [3].In this paper we study about the pair sum labeling of the coconut tree CT(m, n), the Y-tree Y n+1 , the Jelly fish graph J(m, n), the (m, 2)-kite, (m, 1)-kite, the theta graph Ѳ(l [m] ), for m even and complete binary tree.