An Effective Method of Graceful Labeling for Pendant Graphs
DOI:
https://doi.org/10.55927/ijis.v3i9.10487Keywords:
Graceful Labeling, Vertex Graceful, Cyclic Graph, Tetrahedron Graph, Complete GraphAbstract
This study focuses on the significant branch of graph theory known as graceful labeling, which involves assigning integers to the vertices and edges of graphs. Various techniques, such as vertex-graceful, edge-graceful, harmonious, lucky, magic, and prime labeling, have been developed to address this problem. Despite the extensive research on graceful labeling, the specific challenge of labeling pendant graphs gracefully has not been widely explored. Our research proposes new algorithms for gracefully labeling graphs with pendant vertices. These algorithms can be applied to various types of graphs, including cyclic, tetrahedron, regular, octahedron, complete, and square pyramid graphs. By introducing these new methods, we aim to fill the gap in the literature regarding pendant graphs. The study concludes with a detailed case study that illustrates the practical application of the proposed algorithms, demonstrating their effectiveness and ease of use in gracefully labeling pendant graphs. This contribution provides a valuable addition to the existing body of knowledge on graph labeling
Downloads
References
Annamalai, Meenakshi, and Kannan Adhimoolam. 2022. “A Note On Graceful Trees.” AIP Conference Proceedings 2516 (6): 79–84. https://doi.org/10.1063/5.0108571.
Aziz, Momin Al, Forhad Hossain, Tasnia Faequa, and M Kaykobad. 2015. “Graceful Labeling of Trees : Methods and Applications,” no. December 2014. https://doi.org/10.1109/ICCITechn.2014.7073154.
Bell, Matias Von. 2015. “Highlights from the History of Graph Theory,” no. April.
Beutner, Detlev, and Heiko Harborth. 2002. “Graceful Labelings of Nearly Complete Graphs.” Results in Mathematics 41 (1–2): 34–39. https://doi.org/10.1007/BF03322754.
Dharmendra, B N, and R Pradeep Kumar. 2013. “Some Results on the Degree of a Vertex of a Graph with Respect to Any Vertexset,” no. January.
Gallian, Joseph A. 2018. “A Dynamic Survey of Graph Labeling.” Electronic Journal of Combinatorics 1 (DynamicSurveys).
Gayathri, B, and M Subbiah. 2011. “Edge Graceful Labeling of Some Trees.” Global Journal of Mathematical Sciences: Theory and Practical 3 (1): 27–33. http://www.irphouse.com.
Gnang, Edinah K. 2022. “A Proof of the Kotzig-Ringel-Rosa Conjecture” 2: 1–27. http://arxiv.org/abs/2202.03178.
Graf, Alessandra. 2014a. “A New Graceful Labeling for Pendant Graphs.” Aequationes Mathematicae 87 (1–2): 135–45. https://doi.org/10.1007/s00010-012-0184-4.
Graham, R. L., and N. J. A. Sloane. 1980. “On Additive Bases and Harmonious Graphs.” SIAM Journal on Algebraic Discrete Methods 1 (4): 382–404. https://doi.org/10.1137/0601045.
Graf, A. (2014b). Graceful Labelings of Pendant Graphs R ose- H ulman U ndergraduate M athematics J ournal Graceful Labelings of Pendant Graphs. 15(1).
Hrnčiar, Pavel, and Alfonz Haviar. 2001. “All Trees of Diameter Five Are Graceful.” Discrete Mathematics 233 (1–3): 133–50. https://doi.org/10.1016/S0012-365X(00)00233-8.
Jinsiqintuya, Jirimutu. 2012. “On the Gracefulness of the Digraphs n - C→21.” Utilitas Mathematica 89 (3): 311–18.
Mathew, Sunil. 2014. “On Cycle Connectivity of Graphs,” no. September. https://doi.org/10.1142/S0219265912500053.
Redl, Timothy A. 2016. “ON THE ENUMERATION OF A CLASS OF NON-GRACEFUL GRAPHS,” no. January.
Samanta, Sovan, Madhumangal Pal, Rupkumar Mahapatra, Kousik Das, and Robin Singh Bhadoria. 2021. “A Study on Semi-Directed Graphs for Social Media Networks” 14 (1): 1034–41.
Santhakumaran, A. P., and P. Balaganesan. 2018. “Vertex Graceful Labeling of Some Classes of Graphs.” Proyecciones 37 (1): 19–43. https://doi.org/10.4067/S0716-09172018000100019.
Sebastian, Jomon K., and Joseph Varghese Kureethara. 2018. “Pendant Number of Graphs.” International Journal of Applied Mathematics 31 (5): 679–89. https://doi.org/10.12732/ijam.v31i5.12.
Sethuraman, G., and P. Ragukumar. 2017. “Construction of an α-Labeled Tree from a given Set of α-Labeled Trees.” AKCE International Journal of Graphs and Combinatorics 14 (2): 118–29. https://doi.org/10.1016/j.akcej.2017.01.004.
Shivarajkumar, M. A. Sriraj, and S. M. Hegde. 2021. “Graceful Labeling of Digraphs—a Survey.” AKCE International Journal of Graphs and Combinatorics 18 (3): 143–47. https://doi.org/10.1080/09728600.2021.1978014.
Thejeshwi, K, and S Kirupa. 2018. “Application of Graceful Graph in MPLS.” IJSRD-International Journal for Scientific Research & Development| 6 (06): 2321–0613. www.ijsrd.com.
Uma, R, and N Murugesan. 2014. “Graceful Labeling of Some Graphs and Their Subgraphs GRACEFUL LABELING OF SOME GRAPHS AND THEIR SUBGRAPHS,” no. December 2012.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Dinushi Dhananjalee Samarakoon Bathwadana Ralalage, Ekanayake Mudiyanselage Uthpala Senarath Bandara Ekanayake
This work is licensed under a Creative Commons Attribution 4.0 International License.
