• DR. S.P.Viji
• nil

In this paper we investigate the Even Path Decomposition of Geometric Mean Graphs. We use Graph labeling technique for Decomposition of Geometric Mean Graphs 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 xÎV 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)=⌈√(f(u)f(v))⌉(OR)⌊√(f(u)f(v))⌋ then the edge labels are distinct. In this case f is called a Geometric Mean labeling of G.

Geometric Mean Graphs, Even Path Decomposition, Triangular Snake graphs, Diamond Snake graphs, Hexagonal Snake graphs

"Even Path Decomposition of Geometric Mean Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.8, Issue 6, page no.e575-e582, June-2021, Available :http://www.jetir.org/papers/JETIR2106638.pdf

"Even Path Decomposition of Geometric Mean Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.8, Issue 6, page no. ppe575-e582, June-2021, Available at : http://www.jetir.org/papers/JETIR2106638.pdf