Some new classes of graceful coronas and its 2nd kind

Dash, Sushree Shradhanjali; Behera, Amiya Kumar; Bhatta, Debi Prasad; Bohidar, Chapala; Siddique, Mohammed

doi:10.47974/JDMSC-2604

Open Access Research Article

Some new classes of graceful coronas and its 2nd kind

Sushree Shradhanjali Dashshradhanjalidash2000@gmail.comDepartment of Mathematics Siksha ‘O’ Anusandhan (Deemed to be University) Department of Mathematics Siksha ‘O’ Anusandhan (Deemed to be University)Bhubaneswar, Odisha, 751030, IndiaView full profile → , ^*Amiya Kumar BeheraCorresponding authoramiyabehera@soa.ac.inDepartment of Mathematics Siksha ‘O’ Anusandhan (Deemed to be University) Department of Mathematics Siksha ‘O’ Anusandhan (Deemed to be University)Bhubaneswar, Odisha, 751030, IndiaView full profile → , Debi Prasad Bhattadebiprasadbhatta@soa.ac.inDepartment of Mathematics Siksha ‘O’ Anusandhan (Deemed to be University)Bhubaneswar, Odisha, 751030, IndiaView full profile → , Chapala Bohidarchapalabohidar@soa.ac.inDepartment of Mathematics Siksha ‘O’ Anusandhan (Deemed to be University) Bhubaneswar, Odisha, 751030, IndiaView full profile → , Mohammed Siddiquesiddique1807@gmail.comDepartment of Mathematics Centurion University of Technology and ManagementBhubaneswar, Odisha, 752050, IndiaView full profile →

* Corresponding author · click or hover a name for details

pp. 1387–1403Vol. 29Issue 3March 2026DOI: 10.47974/JDMSC-2604 Crossmark XML

Received:: 01 Apr 2025
Published Online:: 11 Mar 2026
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2604
Pages:: 1387–1403

Abstract

A graph labeling assigns integers to the components of a graph (vertices, edges, or both), adhering to specific conditions. Let G be a graph with q edges. Then the graceful labeling is defined as one-one mapping from vertex set of G to {0, 1, ..., q} in this way each edge label arises due to absolute difference of vertex labels of its corresponding vertices, making all edge labels dissimilar. This paper shows that a class of coronas is graceful and of its 2nd kind under certain conditions. The corona graph considered here is a cycle graph with each or alternate vertex attached with two pendant edges.

Keywords

Graceful labeling 2nd kind graceful labeling Cycle Corona Pendant edge

Subject Classifications

05C7805C1005C38

References

[1] A. Akerina and K. A. Sugeng, “Graceful labeling on a multiple-fan graph with pendants,” AIP Conference Proceedings, vol. 2326, no. 1 (2021).
[2] Annamalai, Meenakshi, and K. Adhimoolam, “A Note On Graceful Trees,” AIP Conference Proceedings, vol. 2516, no. 6, pp. 79-84 (2022).
[3] M. Basher, “Odd-even gracefulness of splitting graph of some standard graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 2, pp. 491-502 (2022).
[4] A. K. Behera, “Some Explorations in Graceful Coronas,” Journal of Xi’an University of Architecture and Technology, vol. XIV, no. 3 (2022).
[5] R. Boonklurb, N. Ruamkaew, and S. Singhun, “Directed edge-graceful labeling of digraph consisting of c cycles of the same size,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 1, pp. 53-72 (2022).
[6] D. Dhananjalee and U. Ekanayake, “An Effective Method of Graceful Labeling for Pendant Graphs,” International Journal of Integrative Sciences, vol. 3, no. 9, pp. 1035-1052 (2024).
[7] J. A. Gallian, “A Dynamic Survey of Graph Labeling,” The Electronic Journal of Combinatorics (2022).
[8] R. L. Graham and N. J. A. Sloane, “On additive bases and harmonious graphs,” SIAM Journal of Algebraic Discrete Methods, vol. 1, no. 4, pp. 382-404 (1980).
[9] P. Hrnciar and A. Haviar, “All Trees of Diameter Five Are Graceful,” Discrete Mathematics, vol. 233, pp. 133-150 (2001).
[10] J. Jinsiqintuya, “On the Gracefulness of the Digraphs n-C→21,” Utilitas Mathematica, vol. 89, no. 3, pp. 311-318 (2012).
[11] D. S. Kumar, R. Anbarasan, and G. Pushparaj, “Edge-odd graceful labeling of Cartesian product of two paths,” Journal of Information and Optimization Sciences, vol. 46, no. 3, pp. 591-599 (2025).
[12] A. Kumar, D. Mishra, A. Kumar and V. Kumar, “Alpha Labeling of Cyclic Graphs,” International Journal of Applied and Computational Mathematics, vol. 7, no. 4, pp. 151 (2021).
[13] G. Lau, W. C. Shiu, H. Ng, Z. Gao, and K. Schaffer, “On k-super graceful graphs with extremal maximum vertex degree,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 6, pp. 1765-1783 (2024).
[14] A. Rosa, “On certain valuations of the vertices of a graph,” Theory of Graphs (Internat. Symposium, Rome, July 1966), pp. 349-355 (1967).
[15] J. K. Sebastian and J. V. Kureethara, “Pendant Number of Graphs,” International Journal of Applied Mathematics, vol. 31, no. 5, pp. 679-689 (2018).
[16] Shivarajkumar, M. A. Sriraj and S. M. Hedge, “Graceful Labeling of Digraphs- a Survey,” AKCE International Journal of Graphs and Combinatorics, vol. 18, no. 3, pp. 143-147 (2021).
[17] P. Sumathi and G. Geetha Ramani, “Arithmetic Sequential Graceful Labeling of Complete Bipartite Graph with Pendant Edges,” Revista Electronica De Veterinaria, vol. 25, no. 1, pp. 942-947 (2024).
[18] K. Thejeshwi and S. Kirupa, “Application of Graceful Graph in MPLS,” IJSRD-International Journal for Scientific Research and Development, vol. 6, no. 6, pp. 196-198 (2018).
[19] D. Senthil Kumar, R. Anbarasan and G. Pushparaj, “Edge-odd graceful labeling of Cartesian product of two paths,” Journal of Information and Optimization Sciences, vol. 46, no. 3, pp. 591-599 (2025).

Views: 86Downloads: 9Citations: 0