A radio labeling c of a connected graph G is an assignment of the positive integers to the vertices of G such that for the every pair of distinct vertices u and v,|c(u) – c(v)| ≥ diam(G) + 1 – d(u, v),where diam(G) denotes the diameter of the G and d(u, v) represents the distance between the u and v. If the maximum label assigned to the vertices of G is k, then the minimum such value of k over all possible radio labelings is called the radio number of G and is denoted by rn(G). In this paper, we study the radio labeling of corona graphs which obtained from the cycle graph Cm and the path graph Pn for n ≥ 2. A systematic labeling scheme is developed using the vertex distances and the diameter of the graph, and the corresponding radio numbers are determined. MATLAB programming is also employed to construct the graphs, assign labels, and computationally verify that the radio condition holds for all vertex pairs. This results has extend of the radio labeling properties of the graphs which is corona graph and both provide computational and theoretical support for their such application in frequency network assignment problems.