Geometric meanness of graphs obtained from paths

Abstract

A function f is called a geometric mean labeling of a graph G(V,E) if f: V(G) → {1,2,3,...,9-J-1} is injective and the induced function f^∗: E(G) → {1,2,3,...,?} defined as f^∗(uv) = |√f(u)f(v)| for all uv ∈ E(G), bijective. a graph that admits a geometric mean labeling is called a geometric mean graph. In this paper, we have discussed the geometric meanness of some graphs obtained from paths.