Burning numbers of path forests and spiders

DOI10.1007/S40840-020-00969-WMaRDI QIDQ2021650zbMATH OpenOpenAlexFDO

Authors Huiqing Liu, Xuejiao Hu, Xiaolan Hu

Publication date 27 April 2021

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40840-020-00969-w

zbMATH Keywords

burning numberpath forestsspiders

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43) Social networks; opinion dynamics (91D30)

Recommendations

• Graph burning: tight bounds on the burning numbers of path forests and spiders
• Bounds on the burning numbers of spiders and path-forests
• Burnability of double spiders and path forests
• Burning a graph is hard
• Burning spiders

Cites work

• A note on competitive diffusion through social networks
• An upper bound on the burning number of graphs
• Bounds on the burning number
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph as a model of social contagion
• Burning a graph is hard
• Burning graphs: a probabilistic perspective
• Burning number of caterpillars
• Burning number of graph products
• Graph bootstrap percolation
• Graph searching games and probabilistic methods
• How to Burn a Graph
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• On the burning number of generalized Petersen graphs
• Simplified weak Galerkin and new finite difference schemes for the Stokes equation
• The Firefighter problem: a survey of results, directions and questions

Cited in

(18)

• Burning numbers of \(t\)-unicyclic graphs
• Burnability of double spiders and path forests
• Parameterized complexity of graph burning
• Burning a graph is hard
• Burning spiders
• Graph burning: tight bounds on the burning numbers of path forests and spiders
• The burning number of directed graphs: bounds and computational complexity
• APX-hardness and approximation for the \(k\)-burning number problem
• Parameterized Complexity of Graph Burning
• Burning and \(w\)-burning of geometric graphs
• Burning Numbers of Barbells
• Burning number of Jahangir graphs
• Burning disjoint union of spider and path
• From burning extremal balanced spiders into properties for generalization to all trees
• Burn and win
• Graphs with burning number three
• On the burning number of the generalized Heawood graphs
• Burning number of caterpillars

This page was built for publication: Burning numbers of path forests and spiders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2021650)