Back
 AM  Vol.3 No.3 , March 2012
Further Results on Pair Sum Graphs
Abstract: Let G be a graph. An injective map is called a pair sum labeling if the induced edge function, defined by is one-one and is either of the form or 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 subdivision of some standard graphs.
Cite this paper: R. Ponraj, J. Parthipan and R. Kala, "Further Results on Pair Sum Graphs," Applied Mathematics, Vol. 3 No. 3, 2012, pp. 267-275. doi: 10.4236/am.2012.33042.
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 Combinatorics, 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.

[4]   R. Ponraj and J. V. X. 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

[5]   F. Harary, “Graph Theory,” Narosa Publishing House, New Delhi, 1998.

 
 
Top