Skolem difference mean labeling of H-graphs

A graph G(V,E) with p vertices and q edges is said to have skolem difference mean labeling if it is possible to label the vertices x?V with distinct elements f(x) from 1,2,3…p+q in such a way that the edge e=uv is labeled with if |f(u)-f(v)| is even and if |f(u)-f(v)| is odd and the resulting edges get distinct labels from 1,2,3…q. A graph that admits skolem difference mean labeling is called skolem difference mean graph.