Burning a Graph as a Model of Social Contagion

DOI10.1007/978-3-319-13123-8_2zbMath1342.05154arXiv1511.06774OpenAlexW198180607MaRDI QIDQ2945268

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

Publication date: 9 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

burning numberiterated local transitivity model for social networks

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 (28)

Burning grids and intervals ⋮ A survey of graph burning ⋮ Burning graph classes ⋮ Parameterized complexity of graph burning ⋮ Burning a graph is hard ⋮ Bounds on the burning number ⋮ Rumors Spread Slowly in a Small-World Spatial Network ⋮ Improved and generalized algorithms for burning a planar point set ⋮ Burning and \(w\)-burning of geometric graphs ⋮ 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 ⋮ Throttling for the game of cops and robbers on 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 ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ Burning number of caterpillars ⋮ Firefighting as a Strategic Game ⋮ Burnability of double spiders and path forests

This page was built for publication: Burning a Graph as a Model of Social Contagion