GRAPHS WITH THE BURNING NUMBERS EQUAL THREE

The concept of burning number is inspired by the firefighting problem, which is a new measure to describe the speed of information spread. For a general non-trivial connected graph ????????, its burning number ????????(????????)≥2, and????????(????????) = 2 if and only if the maximum degree of ???????? is |????????|−1or|????????|−2. In this paper, we characterize graphs with burning number????????(????????)=3