Search Results

Graph burning is a discrete-time process that models the spread of social contagion. Initially, all vertices are unburned. In each round, one unburned vertex is selected and burned, while any unburned vertex that has a burned neighbour from the previous round also becomes burned. The burning number of a graph is the minimum number of rounds needed to burn the entire graph. In this paper, we study the burning number of graph powers. First, we show that for a connected graph G, its graph power G^k contains a (k+1)^+-branching tree as a spanning tree. A (k+1)^+-branching tree is one in which all internal vertices have degree at least k+1. We then show that (k+1)^+-branching trees on n vertices have burning number at most ⌈√{4(k-1)n/k²}⌉. As the burning number of a graph is at most the burning number of any of its spanning trees, this gives an upper bound on the burning number of graph powers. We also derive an alternative upper bound on the burning number of k^+-branching trees using the strongest currently known general burning number bound [Bastide et al.]. We then identify the ranges of k and n for which our bound outperforms or matches this alternative bound. Finally, we show that b(G^k) ≤ (1+o(1))√{n/k} based on the asymptotic burning number bound of Norin and Turcotte.