Odd Sum Labeling of Tree Related Graphs

Abstract

An injective function $f:V(G)\to \{ 0,1,2,...,q\} $ is an odd sum labeling if the induced edge labeling $f^{*} $ defined by $f^{*} (uv)=f(u)+f(v)$ for all $uv\in E(G)$ is a bijective and $f^{*} (E(G))=\{ 1,3,5,...,2q-1\} $. 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.