Some Results on 2-odd Labeling of Graphs

2020 International journal of recent technology and engineering  
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 exactly 2. In this paper, we investigate 2-odd labeling of some classes of graphs.
doi:10.35940/ijrte.e7041.018520 fatcat:o5vsskvugvblrpg7tjyhz26fte