A radio Dd-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 , 〖 D〗^Dd (u,v)+⌈(〖f(u)〗^3+〖f(v)〗^3)/(〖f(u)〗^2+〖f(v)〗^2 )⌉ ≥1+〖diam〗^Dd (G) where D^Dd (u,v) denotes Dd- distance between u and v and 〖diam〗^Dd (G) denotes the Dd-diameter of G. The radio Dd-distance in lehmer – 3 mean number of f, 〖rlmn〗^Dd (f) is the maximum label assigned to any vertex of G. The radio Dd- distance in lehmer -3 mean number of G , 〖rlmn〗^Dd (G) is the minimum value of G. In this paper, we investigate the radio Dd-Distance in lehmer – 3 mean number of family of snake graphs.