A graph G is undirected with V vertices and E edges. This study introduces radial radio mean labelling of graphs, a novel method of graph labelling. A radial radio mean labelling of the undirected graph G is a function g : V(G) → {1, 2, …, n} that satisfies the requirement g(u) + g(v)/2 between any two nodes u, v belongs to G and r(G) is the radius of G. The greatest integer in the range of a radial radio mean labelling g is the span, and it is represented by span (g). The minimal span over all G radial radio mean labelling is known as the radial radio mean number rrmn(G). The radial radio mean number of the Grotzsch graph and some graphs have been analyzed in this paper.