A radio circular distance in lehmer-3 mean labeling of a connected graph G is an injective map f from the vertex set V(G) to the N such that for two distinct vertices u and v of G , Cir(u,v)+⌈(〖f(u)〗^3+〖f(v)〗^3)/(〖f(u)〗^2+〖f(v)〗^2 )⌉ ≥1+〖diam〗^C (G) where Cir(u,v) denotes Circular distance between u and v and 〖diam〗^C (G) denotes the circular diameter of G. The radio circular distance in lehmer – 3 mean number of f, 〖r_(l_3 mn)〗^C (f) is the maximum label assigned to any vertex of G. The radio circular distance in lehmer -3 mean number of G , 〖r_(l_3 mn)〗^C (G) is the minimum value of G. In this paper, we investigate the radio circular Distance in lehmer – 3 mean number of some wheel related graphs.