Burning numbers of t-unicyclic graphs

Ruiting Zhang, Yingying Yu, Huiqing Liu

Given a graph $G$, the burning number of $G$ is the smallest integer $k$ for which there are vertices $x_1,x_2,\dots ,x_k$ such that $(x_1,x_2,\dots ,x_k)$ is a burning sequence o…