We study the burning process on connected undirected graphs. During the process the sources burn, and the neighbors of already burned vertices burn. We are interested in the number of steps required for the entire graph to burn, a concept we define as the burning number. The chosen sources in the burning process form a burning sequence. We determine the burning number for simple graph classes such as paths, complete graphs, and wheels. We introduce two characterizations of burning: one using neighborhoods, and another using $k$-good rooted tree partitions. This leads to a tree reduction theorem, which allows us to translate the burning problem for general graphs to the burning problem for trees. Using this theorem, we compute the burning number for cycles and graphs containing a Hamiltonian path. We define well-burnable graphs, which are graphs whose burning number is less than $\lceil\sqrt{n}\rceil$. We examine several proven bounds for the burning number conjecture, which states that all connected graphs are well-burnable. The conjecture has been proven for some classes of graphs. We prove it for caterpillars and spiders.
|
