The week's pick
Random Articles
Reseach Article
Pair Sum Labeling of some Special Graphs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 69 - Number 8 |
| Year of Publication: 2013 |
| Authors: K. Manimekalai, K. Thirusangu |
10.5120/11863-7647
|
K. Manimekalai, K. Thirusangu . Pair Sum Labeling of some Special Graphs. International Journal of Computer Applications. 69, 8 ( May 2013), 34-38. DOI=10.5120/11863-7647
Abstract
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-one and fe(E(G)) is either of the form {?k1, ?k2, …, ?kq/2} or {?k1, ?k2, …, ?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 Yn+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.
References
- J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics,14 (2009), DS6.
- F. Harary, "Graph Theory", Narosa Publishing House, New Delhi, (1998).
- R. Ponraj, J. V. X. Parthipan, "Pair Sum Labeling of Graphs", The Journal of Indian Academy of Mathematics, Vol. 32, No. 2, 2010, pp. 587-595.
- R. Ponraj, J. V. X. Parthipan and R. Kala, "Some Results on Pair Sum Labeling", International Journal of Mathematical Combinatorics, Vol. 4, 2010, pp. 55-61.
- R. Ponraj, J. V. X. Parthipan and R. Kala, "A Note on Pair Sum Graphs", Journal of Scientific Research, Vol. 3, No. 2, 2011, pp. 321-329.
- R. Ponraj, J. V. X. Parthipan, Further Results on Pair Sum Labeling of Trees, Applied Mathematics, 2011, 2, 1270-1278.
- B. West, Introduction to Graph Theory, Prentice-Hall, India, 2001.
Index Terms
Keywords