Different classes of graceful coronas and their second kind
Bijayani Pattanaikbijayanipattanaik27@gmail.comDepartment of MathematicsSiksha ‘O’ Anusandhan (Deemed to be University)Bhubaneswar, Odisha, 751030, IndiaView full profile → , *Amiya Kumar BeheraCorresponding authoramiyabehera@soa.ac.inDepartment of MathematicsSiksha ‘O’ Anusandhan (Deemed to be University)Bhubaneswar, Odisha, 751030, IndiaView full profile → , Chapala Bohidarchapalabohidar@soa.ac.inDepartment of MathematicsSiksha ‘O’ Anusandhan (Deemed to be University)Bhubaneswar, Odisha, 751030, IndiaView full profile → , Biswadarsi Biswalbiswadarsi@gift.edu.inDepartment of Computer Science & EngineeringGIFT Autonomous BhubaneswarBhubaneswar, Odisha, 752054, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Jul 2025
- Published Online:
- 14 Aug 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2640
- Pages:
- 3037–3049
Abstract
A graph labeling assigns integer 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 a one-to-one mapping from the vertex set of G to {0, 1, ..., q} so that each edge label arises due to the absolute difference of vertex labels of its corresponding vertices, making all edge labels dissimilar. This paper demonstrates that a class of coronas is graceful and of the second kind under specific conditions. The corona graph considered here is a cycle graph with each or every other vertex attached to two pendant edges.
Keywords
Subject Classifications
References
[1] A. Akerina and K. A. Sugeng, “Graceful labeling on a multiple-fan graph with pendants,” AIP Conf. Proc., vol. 2326, Art. no. 020005 (2021), doi: 10.1063/5.0039498.
[2] M. Basher, “Odd-even gracefulness of splitting graph of some standard graphs,” J. Discrete Math. Sci. Cryptogr., vol. 25, no. 2, pp. 491–502 (2022), doi: 10.1080/09720529.2021.1885599.
[3] A. K. Behera, “Some Explorations in Graceful Coronas,” J. Xi’an Univ. Archit. Technol., vol. XIV, no. 3, pp. 142–151 (2022).
[4] R. Boonklurb, N. Ruamkaew, and S. Singhun, “Directed edge-graceful labeling of digraph consisting of c cycles of the same size,” J. Discrete Math. Sci. Cryptogr., vol. 25, no. 1, pp. 53–72 (2022), doi: 10.1080/09720529.2021.1885601.
[5] D. Dhananjalee and U. Ekanayake, “An Effective Method of Graceful Labeling for Pendant Graphs,” Int. J. Integr. Sci., vol. 3, no. 9, pp. 1035–1052 (2024), doi: 10.55927/ijis.v3i9.11742.
[6] J. A. Gallian, “A Dynamic Survey of Graph Labeling,” Electron. J. Combin., Dynamic Surveys, DS6 (2022).
[7] D. S. Kumar, R. Anbarasan, and G. Pushparaj, “Edge-odd graceful labeling of Cartesian product of two paths,” J. Inf. Optim. Sci., vol. 46, no. 3, pp. 591–599 (2025), doi: 10.47974/JIOS-1887.
[8] A. Kumar, D. Mishra, A. Kumar, and V. Kumar, “Alpha Labeling of Cyclic Graphs,” Int. J. Appl. Comput. Math., vol. 7, Art. no. 124 (2021), doi: 10.1007/s40819-021-01074-2.
[9] G. Lau, W. C. Shiu, H. Ng, Z. Gao, and K. Schaffer, “On k-super graceful graphs with extremal maximum vertex degree,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 6, pp. 1765–1783 (2024), doi: 10.47974/JDMSC-2148.
[10] K. Murugesan and R. Uma, “A Study on Super Vertex Graceful Graphs,” Int. J. Comput. Appl., vol. 95, no. 10, pp. 1–5 (2014), doi: 10.5120/16642-6655.
[11] A. Rosa, “On certain valuations of the vertices of a graph,” in Theory of Graphs (Proc. Int. Symp., Rome, Italy, Jul. 1966), New York, USA: Gordon and Breach, and Paris, France: Dunod, pp. 349–355 (1967).
[12] P. Sumathi and G. Geetha Ramani, “Arithmetic Sequential Graceful Labeling of Complete Bipartite Graph with Pendant Edges,” Rev. Electron. Vet., vol. 25, no. 1S, pp. 942–947 (2024).
