Burnability of double spiders and path forests

DOI10.1016/j.amc.2022.127574OpenAlexW4300982387MaRDI QIDQ2096325

Ta Sheng Tan, Wen Chean Teh

Publication date: 16 November 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.13855

zbMATH Keywords

graph algorithmburning number conjecturedouble spiderpath forestspread of social contagion

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Burning number of caterpillars
• Bounds on the burning number
• Burning number of graph products
• An upper bound on the burning number of graphs
• Burning graphs: a probabilistic perspective
• On the burning number of \(p\)-caterpillars
• Bounds on the burning numbers of spiders and path-forests
• Burning spiders
• Graph burning: tight bounds on the burning numbers of path forests and spiders
• Burning a Graph as a Model of Social Contagion
• A survey of graph burning
• How to Burn a Graph

This page was built for publication: Burnability of double spiders and path forests