January 2012
·
78 Reads
·
8 Citations
International Journal of Mathematics Trends and Technology
A graphs 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 way that when each edge e=uv is labeled with f(uv)=f(u)f(v) or f(u)f(v) then the edge labels are distinct. Here we prove that C m ∪P n , C m ∪C n , nK 3 ,nK 3 ∪P n , nK 3 ∪C m , crown, square of a path are geometric mean graphs.