pith. sign in

arxiv: 1507.06524 · v1 · pith:HBQMT6XOnew · submitted 2015-07-23 · 🧮 math.CO

How to burn a graph

classification 🧮 math.CO
keywords graphnumberburningcontagiongraphsbootstrapboundsburn
0
0 comments X
read the original abstract

We introduce a new graph parameter called the burning number, inspired by contact processes on graphs such as graph bootstrap percolation, and graph searching paradigms such as Firefighter. The burning number measures the speed of the spread of contagion in a graph; the lower the burning number, the faster the contagion spreads. We provide a number of properties of the burning number, including characterizations and bounds. The burning number is computed for several graph classes, and is derived for the graphs generated by the Iterated Local Transitivity model for social networks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.