Abstract
AbstractGraph burning is a discrete time process which can be used to model the spread of social contagion. One is initially given a graph of unburned vertices. At each round (time step), one vertex is burned; unburned vertices with at least one burned neighbour from the previous round also becomes burned. The burning number of a graph is the fewest number of rounds required to burn the graph. It has been conjectured that for a graph on n vertices, the burning number is at most $$\lceil \sqrt{n}\rceil $$
⌈
n
⌉
. We show that the graph burning conjecture is true for trees without degree-2 vertices.
Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. Albertson, M.O., Berman, D.M., Hutchinson, J.P., Thomassen, C.: Graphs with homeomorphically irreducible spanning trees. J. Graph Theory 14(2), 247–258 (1990)
2. Alon, N.: Transmitting in the $$n$$-dimensional cube. Discret. Appl. Math. 37, 9–11 (1992)
3. Alon, N.: Spanning trees with few non-leaves. Israel J. Math. 256(1), 9–20 (2023)
4. Bastide, P., Bonamy, M., Bonato, A., Charbit, P., Kamali, S., Pierron, T., Rabie, M.: Improved pyrotechnics: closer to the burning graph conjecture. arXiv preprint arXiv:2110.10530 (2021)
5. Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E.: Burning a graph is hard. Discret. Appl. Math. 232, 73–87 (2017)