Volume :7 , Issue :4 ,Page :95-103
Abstract :An injective function } ,..., 2 , 1 , 0 { ) ( : q G V f is an odd sum labeling if the induced edge labeling * f defined by ) ( ) ( ) ( * v f u f uv f for all ) ( G E uv is a bijective and } 1 2 ,..., 5 , 3 , 1 { ) ( : * q G E f . A graph is said to be an odd sum graph if it admits an odd sum labeling. In this paper we investigate odd sum labeling of some more graphs.