Odd mean labeling for two star graph

In this paper further result on odd mean labeling is discussed. We prove that the two star G = K_1,m ∧ K_1,n is an odd mean graph if and only if |m − n| ≤ 3. The condition for a graph to be odd mean is that p ≤ q + 1, where p and q stands for the number of the vertices and edges in the graph respectively.