How to Burn a Graph

DOI10.1080/15427951.2015.1103339zbMath1461.05193arXiv1507.06524OpenAlexW1497626542MaRDI QIDQ5856432

Elham Roshanbin, Anthony Bonato, Jeannette C. M. Janssen

Publication date: 26 March 2021

Published in: Internet Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (33)

Burning grids and intervals ⋮ Surviving rate of graphs and firefighter problem ⋮ Unnamed Item ⋮ A survey of graph burning ⋮ Burning graph classes ⋮ Parameterized complexity of graph burning ⋮ A new model and algorithms in firefighting theory ⋮ Graph burning: tight bounds on the burning numbers of path forests and spiders ⋮ Burning a graph is hard ⋮ Bounds on the burning number ⋮ Selection of activators in finding the burning number ⋮ Burning and \(w\)-burning of geometric graphs ⋮ Graph burning and non-uniform \(k\)-centers for small treewidth ⋮ Burn and win ⋮ Improved pyrotechnics: closer to the burning number conjecture ⋮ Burning the plane. Densities of the infinite Cartesian grid ⋮ Burning Two Worlds ⋮ The generalized burning number of graphs ⋮ Parameterized Complexity of Graph Burning ⋮ Burning graphs: a probabilistic perspective ⋮ Burning numbers of path forests and spiders ⋮ Burning number of graph products ⋮ Burning number of theta graphs ⋮ On the burning number of generalized Petersen graphs ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Improved bounds for burning fence graphs ⋮ On the burning number of \(p\)-caterpillars ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ Burning number of caterpillars ⋮ The iterated local model for social networks ⋮ Bounds on the burning numbers of spiders and path-forests ⋮ Burnability of double spiders and path forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of Nordhaus-Gaddum type relations
• The firefighter problem for graphs of maximum degree three
• Burning a graph is hard
• Information diffusion on the iterated local transitivity model of online social networks
• Epidemic Spreading With External Agents
• Graph bootstrap percolation
• The small-world phenomenon
• On Complementary Graphs
• Cleaning Regular Graphs with Brushes
• Firefighting on a random geometric graph
• Models of Online Social Networks
• Automata, Languages and Programming

This page was built for publication: How to Burn a Graph