Main Article Content
Abstract
A graph is said to be a 2-odd graph if the vertices of can be labelled with integers (necessarily distinct) such that for any two vertices which are adjacent, then the modulus difference of their labels is either an odd integer or 2. In this paper, we investigate 2-odd labeling of some graphs.