Radio mean labeling of a connected graph G is a one to one map from the vertex set

 to a set of natural numbers N such that for each distinct vertices u and v of G,

The radio mean number of f,  is the maximum number assigned for any vertex of G. The radio mean number of G,  is the minimum value of  taken over all radio mean labeling f of G. In this paper, we determine the radio mean number of a uniform theta graph and series of uniform theta graph.

labeling, radio mean labeling, radio mean number, uniform theta graph.