Forest fire on random graph with inflammable edges

Random graphs with vertex degrees drawn independently from a power-1aw distribution are considered. Using computer simulations, we found an optima1 graph topo1ogy instrumental in preservation of the maximum number of vertices in case the fire starts from one vertex and spreads a1ong the edges of the graph.