Burning numbers of path forests and spiders

DOI10.1007/s40840-020-00969-wzbMath1462.05254OpenAlexW3042661461MaRDI QIDQ2021650

Xuejiao Hu, Huiqing Liu, 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

spidersburning numberpath forests

Mathematics Subject Classification ID

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

Related Items

Parameterized complexity of graph burning, Parameterized Complexity of Graph Burning, APX-hardness and approximation for the \(k\)-burning number problem, Burning numbers of \(t\)-unicyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the burning number of generalized Petersen graphs
• Burning number of caterpillars
• A note on competitive diffusion through social networks
• Bounds on the burning number
• Burning number of graph products
• An upper bound on the burning number of graphs
• Burning graphs: a probabilistic perspective
• Simplified weak Galerkin and new finite difference schemes for the Stokes equation
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph is hard
• Burning a Graph as a Model of Social Contagion
• Graph bootstrap percolation
• Graph Searching Games and Probabilistic Methods
• How to Burn a Graph