Graph burning: Tight bounds on the burning numbers of path forests and spiders

作者：

Highlights：

• Discrete-time deterministic graph algorithm modelling the spread of social contagion.

• Tight bounds on the burning numbers of spiders based on the number of arms.

• New perspective and approach towards the burning number conjecture.

摘要

•Discrete-time deterministic graph algorithm modelling the spread of social contagion.•Tight bounds on the burning numbers of spiders based on the number of arms.•New perspective and approach towards the burning number conjecture.

论文关键词：Burning number conjecture,Graph algorithm,Spider,Path forest

论文评审过程：Received 10 February 2020, Revised 2 June 2020, Accepted 7 June 2020, Available online 20 June 2020, Version of Record 20 June 2020.

论文官网地址：https://doi.org/10.1016/j.amc.2020.125447