Further Results on Pair Sum Labeling of TreesReportar como inadecuado

Further Results on Pair Sum Labeling of Trees - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Let G be a p,q graph. An injective map f:VG→﹛±1,±2,

.±p﹜is called a pair sum labeling if the induced edge function, fe:EG→Z-﹛0﹜defined by feuv=fu+fv is one-one and feEG is either of the form {±k1,±k2,

.,±kq-2} or {±k1,±k2,

.,±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.


Path, Star, Bistar, Tree

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.

Autor: Raja Ponraj, Jeyaraj Vijaya Xavier Parthipan

Fuente: http://www.scirp.org/


Documentos relacionados