Let W be a simple connected graph. A radio geometric mean of a connected graph is a one-to-one mapping \(g:V(W) \rightarrow N\) such that for every two vertices \(p,q \in V(W)\) satisfying the condition \(\sqrt{(g(p).g(q))} \ge diam(W)+1-d(p,q)\) , where diam(W) is the diameter of the graph and d(p, q) is the distance between p and q in W. The radio geometric mean of the graph W, rgmn(W) is the minimum value allocated to any vertex of graph and radio geometric mean of the function g, rgmn(g) is the maximum value assigned to any vertex of the graph W. This paper examined the radio geometric mean number for some cycle-related graphs, i.e., n-copies of \(C_{m}\) joined by a path, (m, n)-Tadpole graph, cycle with one chord graph, and star of cycle graph. The results presented in this paper demonstrate the possible uses in fields like pattern recognition, computational complexity, and network routing.