Radio numbers of corona product graphs : Analytical results and MATLAB-assisted verification
Varsha Rathi2022401996.varsha@dr.sharda.ac.inDepartment of Mathematics & Data SciencesSharda School of Engineering and SciencesSharda UniversityGreater Noida, Uttar Pradesh, 201310, IndiaView full profile → , *Sweta SrivastavCorresponding authorsweta.srivastav@sharda.ac.inDepartment of Mathematics & Data SciencesSharda School of Engineering and SciencesSharda UniversityGreater Noida, Uttar Pradesh, 201310, IndiaView full profile → , Sangeeta Guptasangeeta.gupta@sharda.ac.inDepartment of Mathematics & Data SciencesSharda School of Engineering and SciencesSharda UniversityGreater Noida, Uttar Pradesh, 201310, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Jan 2026
- Published Online:
- 30 Sep 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2863
- Pages:
- 3475–3484
Abstract
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.
Keywords
Subject Classifications
References
[1] M. S. Aasi, M. Asif, T. Iqbal, and M. Ibrahim, “Radio labelings of lexicographic product of some graphs,” J. Math., vol. 2021, Art. no. 9177818, pp. 1–6 (2021), doi: 10.1155/2021/9177818.
[2] R. Frucht and F. Harary, “On the corona of two graphs,” Aequationes Math., vol. 4, no. 3, pp. 322–325 (1970), doi: 10.1007/BF01844162.
[3] F. Harary, Graph Theory. Reading, MA, USA: Addison-Wesley (1972).
[4] G. Chartrand, D. J. Erwin, F. Harary, and P. Zhang, “Radio labelings of graphs,” Bull. Inst. Combin. Appl., vol. 33, pp. 77–85 (2001).
[5] W. K. Hale, “Frequency assignment: Theory and applications,” Proc. IEEE, vol. 68, no. 12, pp. 1497–1514 (Dec. 1980), doi: 10.1109/PROC.1980.11899.
[6] J. A. Gallian, “A dynamic survey of graph labeling,” Electron. J. Combin., Dynamic Survey DS6 (2025), doi: 10.37236/27.
[7] V. J. Kaneria, M. M. Jariya, and H. M. Makadia, “Graceful labeling of arrow graphs and double arrow graphs,” Malaya J. Mat., vol. 3, no. 4, pp. 382–386 (2015), doi: 10.26637/mjm304/002.
[8] D. D.-F. Liu and M. Xie, “Radio number for square of cycles,” Congressus Numerantium, vol. 169, pp. 105–125 (2004).
[9] D. D.-F. Liu and X. Zhu, “Multilevel distance labelings for paths and cycles,” SIAM J. Discrete Math., vol. 19, no. 3, pp. 610–621 (2005), doi: 10.1137/S0895480102417768.
[10] D. D.-F. Liu and M. Xie, “Radio number for square paths,” Ars Combinatoria, vol. 90, pp. 307–319 (2009).
[11] R. Ponraj, S. S. Narayanan, and R. Kala, “Radio mean labeling of a graph,” AKCE Int. J. Graphs Comb., vol. 12, nos. 2–3, pp. 224–228 (2015), doi: 10.1016/j.akcej.2015.11.019.
[12] K. Palani, S. S. Sabarina Subi, and V. Maheswari, “Radio mean labeling of path union of some graphs,” Adv. Appl. Math. Sci., vol. 21, no. 4, pp. 2199–2209 (2022).
[13] Z. Shao, R. K. Yeh, and D. Zhang, “The L(2,1)-labeling on graphs and the frequency assignment problem,” Appl. Math. Lett., vol. 21, no. 1, pp. 37–41 (2008), doi: 10.1016/j.aml.2006.08.029.
[14] P. Gupta, S. Gupta, and S. Srivastav, “Radio mean labeling of graph and its subdivision,” Indian J. Nat. Sci., vol. 15, no. 86, pp. 80283–80288 (2024).
[15] V. Rathi and S. Srivastav, “Radio mean labeling of arrow graph and its related graphs,” in 7th International Conference on Recent Advances in Mathematical Sciences and Its Applications (RAMSA 2024): Abstract Book, p. 6 (2024), doi: 10.21467/abstracts.165.
[16] U. Sekar, “Applications of graph theory in computer science,” Int. J. Electron. Commun. Comput. Eng., vol. 4 (2013).
[17] K. Sunitha, C. D. Raj, and A. Subramanian, “Radio mean labeling of path and cycle related graphs,” Glob. J. Math. Sci.: Theory Pract., vol. 9, no. 3, pp. 337–345 (2017).
[18] R. Selvaraj, S. Vidyanandini, and S. R. Nayak, “Radial radio mean labelling of Grotzsch graph and some graphs,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 4, pp. 1377–1387 (2024), doi: 10.47974/JDMSC-1992.
[19] R. Sweetly and J. Paulraj Joseph, “The radio number of (W_n : 2) graphs,” J. Discrete Math. Sci. Cryptogr., vol. 12, no. 6, pp. 729–736 (2009), doi: 10.1080/09720529.2009.10698268.
[20] R. Sweetly and J. Paulraj Joseph, “Radio number of graphs of diameter three,” J. Discrete Math. Sci. Cryptogr., vol. 10, no. 5, pp. 721–730 (2007), doi: 10.1080/09720529.2007.10698152.
