Share This Article:

Further Results on Pair Sum Labeling of Trees

Abstract Full-Text HTML Download Download as PDF (Size:215KB) PP. 1270-1278
DOI: 10.4236/am.2011.210177    3,803 Downloads   6,836 Views   Citations

ABSTRACT

Let G be a (p,q) graph. An injective map f:V(G)→﹛±1,±2,...±p﹜is called 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 {±k1k2,...,±kq/2} or {±k1k2,...,±kq-1/2}∪{kq+1/2} according as q is even or odd. A graph with a pair sum labeling is called a pair sum graph. In this paper we investigate the pair sum labeling behavior of some trees which are derived from stars and bistars. Finally, we show that all trees of order nine are pair sum graphs.

KEYWORDS

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

R. Ponraj and J. Parthipan, "Further Results on Pair Sum Labeling of Trees," Applied Mathematics, Vol. 2 No. 10, 2011, pp. 1270-1278. doi: 10.4236/am.2011.210177.

References

[1] R. Ponraj and J. V. X. Parthipan, “Pair Sum Labeling of Graphs,” The Journal of Indian Academy of Mathematics, Vol. 32, No. 2, 2010, pp. 587-595.
[2] R. Ponraj, J. V. X. Parthipan and R. Kala, “Some Results on Pair Sum Labeling,” International Journal of Mathematical Com-binatorics, Vol. 4, 2010, pp. 53-61.
[3] 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. doi:10.3329/jsr.v3i2.6290
[4] F. Harary, “Graph Theory,” Narosa Pub-lishing House, New Delhi, 1998.
[5] R. Ponraj, J. V. X. Parthipan and R. Kala, “Pair Sum Labeling of Some Trees,” The Journal of Indian Academy of Mathematics (Communicated), in Press.

  
comments powered by Disqus

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.