A Graph G = (V,E) with p vertices and q edges is said to be a Geometric mean graph if it is possible to label the vertices xV with distinct labels f(x) from 1,2…..q+1 in such a way that when each edge e=uv is labeled with f(e=uv) = (or) , then the resulting edge labels are all distinct. In this case, f is called Geometric mean labeling of G. In this paper we prove that,