Some Results on 2-odd Labeling of Graphs
P. Abirami, A. Parthiban, N. Srinivasan · International Journal of Recent Technology and Engineering (IJRTE) · 2020
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 exactly 2. In this paper, we investigate 2-odd labeling of some classes of graphs.