2-odd labeling assigns distinct integers to the nodes of a graph G(V, E) in such a manner, that the positive difference of adjacent nodes is either 2 or an odd integer, 2k ± 1, k ? N. So, G is a 2-odd graph if and only if ...