The Burning Number Conjecture is True for Trees without Degree-2 Vertices
Graphs and Combinatorics · 2024-08 · 40 (4)
DOI: 10.1007/s00373-024-02812-6 ↗Kurz gefasst
Fachartikel in der Zeitschrift Graphs and Combinatorics, online erschienen am 25.06.2024. Verfasst von Yukihiro Murakami. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Graph 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.
Zitieren
APA
Murakami, Y. (2024). The Burning Number Conjecture is True for Trees without Degree-2 Vertices. Graphs and Combinatorics, 40(4). https://doi.org/10.1007/s00373-024-02812-6
Vancouver
Murakami Y. The Burning Number Conjecture is True for Trees without Degree-2 Vertices. Graphs and Combinatorics. 2024;40(4). doi:10.1007/s00373-024-02812-6
BibTeX
@article{Murakami2024,
author = {Murakami, Yukihiro},
title = {The Burning Number Conjecture is True for Trees without Degree-2 Vertices},
journal = {Graphs and Combinatorics},
year = {2024},
volume = {40},
number = {4},
doi = {10.1007/s00373-024-02812-6}
}
EUVIMED