Every lobster is odd-elegant

A graph G having q edges is odd-elegant if it admits a mapping f:V(G)→{0,1,2,…,2q−1} with f(u)≠f(v) for distinct u,v∈V(G), and the label f(uv) of every edge uv∈E(G) is defined as such that the set of all edge labels is equal to {1,3,5,…,2q−1}. We show that every lobster is odd-elegant.