Burning number of triangular-like architectures

Kannan, V. Kamala; Rajan, R. Sundara; Rajalaxmi, T. M.; Emilet, D. Ahima

doi:10.47974/JDMSC-2575

Open Access Research Article

Burning number of triangular-like architectures

V. Kamala Kannan84kamalakannan@gmail.comDepartment of Mathematics Hindustan Institute of Technology and ScienceChennai, Tamil Nadu, 603103, India0009-0001-2187-1900View full profile → , ^*R. Sundara RajanCorresponding authorvprsundar@gmail.comDepartment of Mathematics Rajalakshmi Engineering CollegeChennai, Tamil Nadu, 602105, India0000-0002-1851-6334View full profile → , T. M. Rajalaxmilaxmi.raji18@gmail.comDepartment of Mathematics Sri Sivasubramaniya Nadar College of EngineeringChennai, Tamil Nadu, 603110, India0000-0001-9700-8110View full profile → , D. Ahima Emiletahi.180492@gmail.comDepartment of Mathematics Hindustan Institute of Technology and ScienceDepartment of Mathematics Hindustan Institute of Technology & ScienceChennai, Tamil Nadu, 603103, India0000-0002-3424-2126View full profile →

* Corresponding author · click or hover a name for details

pp. 1787–1797Vol. 29Issue 4April 2026DOI: 10.47974/JDMSC-2575 Crossmark XML

Received:: 01 May 2025
Published Online:: 08 Apr 2026
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2575
Pages:: 1787–1797

Abstract

The study of graph burning is a crucial area in graph theory, providing insight into the spread of influence, information, or fire across networks. This paper investigates the burning number of triangular grid graphs and Sierpinski gasket graphs, which represent a class of lattice-based and fractal architectures. For triangular grids, we derive a lower bound for the burning number and provide a mathematical framework supporting its validity. Similarly, for Sierpinski gasket graphs, we establish new lower bounds by analyzing their recursive structure and boundary-vertex distribution. Our results emphasize the relationship between the graph’s structural properties and the derived lower bounds on their burning numbers. These findings improve the theoretical understanding of burning dynamics in triangular-like architectures, with potential applications in network design and resource allocation.

Keywords

Burning number Triangular grids Sierpinski gasket graph

Subject Classifications

05C3005C3505C90

References

[1] A. Bonato, J. Janssen, and E. Roshanbin, “Burning a graph as a model of social contagion,” in Algorithms and Models for the Web Graph, A. Bonato, F. Chung Graham, and P. Prałat (Eds.), Lecture Notes in Computer Science, Cham: Springer, vol. 8882, pp. 13–22 (2014).

[2] A. Bonato, J. Janssen, and E. Roshanbin, “How to burn a graph,” Internet Mathematics, vol. 12, no. 1-2, pp. 85-100 (2016).

[3] D. Mitsche, P. Prałat, and E. Roshanbin, “Burning number of graph products,” Theoretical Computer Science, vol. 746, pp. 124-135 (2018).

[4] A. Bonato and S. Kamali, “An improved bound on the burning number of graphs,” arXiv preprint arXiv:2110.01087 (2021).

[5] D. Antony, A. Das, S. Gosavi, D. Jacob, and S. Kulamarva, “Graph burning: Bounds and hardness,” arXiv preprint arXiv:2402.18984 (2024).

[6] E. Roshanbin, “Burning a graph as a model of social contagion,” Ph.D. dissertation, Dalhousie Univ., Halifax, Canada (2016).

[7] A. T. Gupta, S. A. Lokhanda, and K. Mondal, “Burning grids and intervals,” In Proc. 7th Int. Conf. Combinatorial Algorithms (CALDAM), Lecture Notes in Computer Science, vol. 12601, Cham: Springer, pp. 60-79 (2021).

[8] K. A. Sim, T. S. Tan, and K. B. Wong, “On the burning number of generalized Petersen graphs,” Bull. Malaysian Math. Sci. Soc., vol. 41, pp. 1657-1670 (2018).

[9] A. S. Kare and I. V. Reddy, “Parameterized algorithms for graph burning problem,” In Proc. Int. Workshop Combinatorial Algorithms (IWOCA), Lecture Notes in Computer Science, vol. 11638, Cham: Springer, pp. 304-314 (2019).

[10] N. Alon, “Transmitting in the n-dimensional cube,” Discrete Applied Mathematics, vol. 37-38, pp. 9-11 (1992).

[11] R. S. Rajan, P. Manuel, I. Rajasingh, N. Parthiban, and M. Miller, “A lower bound for dilation of an embedding,” The Computer Journal, vol. 58, no. 12 (2015).

[12] Y. M. Ko and N. Gautam, “Epidemic-based information dissemination in wireless mobile sensor networks,” IEEE/ACM Transactions on Networking, vol. 18, no. 6, pp. 1738-1751 (2010).

[13] Y. Wu, C. Pu, G. Zhang, L. Li, Y. Xia, and C. Xia, “Epidemic spreading in wireless sensor networks with node sleep scheduling,” Physica A: Statistical Mechanics and its Applications, vol. 629, no. 129204 (2023).

[14] A. Bonato, J. Janssen, and E. Roshanbin, “Burning a graph is hard,” Discrete Applied Mathematics, vol. 232, pp. 73-87 (2017).

[15] S. Kavitha, S. Robinson Chellathurai, and J. John, “On the forcing connected domination number of a graph,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 20, no. 3, pp. 611-624 (2017).

[16] T. A. Chishti, H. A. Ganie, and S. Pirzada, “Properties of strong double graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 17, no. 4, pp. 311-319 (2014).

[17] I. H. Agustin, L. Susilowati, Dafik, I. N. Cangul, and N. Mohanapriya, “On the vertex irregular reflexive labeling of several regular and regular-like graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 5, pp. 1457-1473 (2022).

[18] P. L. K. Priyadarsini, “A survey on some applications of graph theory in cryptography,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 18, no. 3, pp. 209-217 (2015).

Views: 48Downloads: 10Citations: 0