Keywords : Distance Graphs
European Journal of Molecular & Clinical Medicine,
2020, Volume 7, Issue 7, Pages 3914-3918
A graph 𝑮 is a 2-odd graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the absolute difference of their labels is either an odd integer or 2. In this paper, we investigate 2-odd labeling of various classes of graphs.