BURNING NUMBER OF SNAKE RELATED GRAPHS
Keywords:
burning, web, snake graph, quadrilateral, pentagonal snakeDOI:
https://doi.org/10.17654/0974165826009Abstract
Graph burning refers to the minimum number of moves necessary for data propagation in a network. Data circulation is modeled as a graph, and the concept of graph burning is used. Determining the network’s burning number can reveal how quickly information spreads among followers and how it impacts the entire network. Even when memes are shared on social media sites like Facebook and Instagram, the network’s burning number may be used to gauge how quickly information reaches its followers and how much impact it has on the entire network. In this paper, we have found the burning number for certain graphs, like the web graph and some snake-related graphs, which include the triangular snake graph, the quadrilateral snake graph, and the pentagonal snake graph.
Received: July 18, 2025
Revised: November 7, 2025
Accepted: November 13, 2025
References
[1] A. Bonato, J. Janssen and E. Roshanbin, Burning a graph as a model of social contagion, Lecture Notes in Comput. Sci. 8882 (2014), 13-22.
[2] J. Garcia-Diaz, L. M. X. Rodriguez-Henriquez, J. C. Perez-Sansalvador and S. E. Pomares-Hernandez, Graph burning: mathematical formulations and optimal solutions, Mathematics 10 (2022), 2777.
[3] Jiaqi Song, Xing Qi and Zhulou Cao, An independent cascade model of graph burning, Symmetry 15 (2023), 1527.
[4] Joseph A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. 25 (2022), 12-20.
[5] Mohamed Omar and Vibha Rohilla, Burning graph classes, Graphs Combin. 38 (2022), 121.
[6] Nilay Torun and Emrah Akyar, Burning number of Jahangir graphs, Asian European Journal of Mathematics 16 (2023), 2350177.
[7] Rahul Kumar Gautam, Anjeneya Swamin Kare and Durga Bhavani, Faster heuristics for graph burning, Applied Intelligence 52 (2022), 1351-1361.
[8] S. Sumathi and G. Hannah Grace, Selection of activators in finding the burning number, AKCE Int. J. Graphs Comb. 20 (2023), 115-119.
[9] Yasuaki Kobayashi and Yota Otachi, Parameterized complexity of graph burning, Algorithmica 84 (2022), 2379-2393.
[10] Yinkui Li, Xiaoxiao Qin and Wen Li, The generalized burning number of graphs, Appl. Math. Comput. 411 (2021), 126306.
[11] Wen Li, Graphs with burning number equal three, International Journal of Research Granthaalayah 11 (2023), 145-150.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 PUSHPA PUBLISHING HOUSE, PRAYAGRAJ, INDIA

This work is licensed under a Creative Commons Attribution 4.0 International License.
_________________________
Attribution: Credit Pushpa Publishing House as the original publisher, including title and author(s) if applicable.
Contact Pushpa Publishing House for more info or permissions.
Journal Impact Factor: 