Abstract
Let G be a connected graph with n≥2 vertices. Suppose that a fire breaks out at a vertex v of G. A firefighter starts to protect vertices. At each time interval, the firefighter protects one vertex not yet on fire. At the end of each time interval, the fire spreads to all the unprotected vertices that have a neighbor on fire. Let sn(v) denote the maximum number of vertices in G that the firefighter can save when a fire breaks out at vertex v. The surviving rate ρ(G) of G is defined to be ∑ v∈V(G)sn(v)/n 2, which is the average proportion of saved vertices.
In this paper, we show that if G is a planar graph with n≥2 vertices and having girth at least 7, then \(\rho(G)>\frac{1}{301}\).
Similar content being viewed by others
References
Cai L, Wang W (2009) The surviving rate of a graph for the firefighter problem. SIAM J Discrete Math 23:1814–1826
Cai L, Cheng Y Verbin E, Zhou Y (2010) Surviving rates of graphs with bounded treewidth for the firefighter problem. SIAM J Discrete Math 24:1322–1335
Finbow S, King A, MacGillivray G, Rizzi R (2007) The firefighter problem for graphs of maximum degree three. Discrete Math 307:2094–2105
Finbow S, MacGillivray G (2009) The firefighter problem: a survey of results, directions and questions. Australas J Comb 43:57–77
Hartnell B (1995) Firefighter! An application of domination. In: Presentation at the 25th Manitoba conference on combinatorial mathematics and computing, Winnipeg, Canada. University of Manitoba
King A, MacGillivray G (2010) The firefighter problem for cubic graphs. Discrete Math 310:614–621
Kong J, Wang W, Zhu X (2012) The surviving rate of planar graphs. Theor Comput Sci 416:65–70
MacGillivray G, Wang P (2003) On the firefighter problem. J Comb Math Comb Comput 47:83–96
Newman ME, Jensen I, Ziff RM (2002) Percolation and epidemics in a two-dimensional small world. Phys Rev E 65:021904
Pastor-Satorras R, Vespignani A (2001) Epidemic spreading in scale-free networks. Phys Rev Lett 86:3200–3203
Potapov AB, Lewis MA (2008) Allee effect and control of lake system invasion. Bull Math Biol 70:1371–1397
Prałat P (2011) Graphs with average degree smaller than \(\frac{30}{11}\) are bounding slowly. Submitted
Wang W, Finbow S, Wang P (2010) The surviving rate of an infected network. Theor Comput Sci 411:3651–3660
Wang P, Moeller SA (2002) Fire control on graphs. J Comb Math Comb Comput 41:19–34
Author information
Authors and Affiliations
Corresponding author
Additional information
First author is supported by NSFC (No. 11071223), ZJNSFC (No. Z6090150), ZJIP (No. T200905), ZSDZZZZXK13, IP-OCNS-ZJNU, and the James Chair at St. Francis Xavier University.
Second and third authors are supported by NSERC.
Rights and permissions
About this article
Cite this article
Wang, W., Finbow, S. & Wang, P. A lower bound of the surviving rate of a planar graph with girth at least seven. J Comb Optim 27, 621–642 (2014). https://doi.org/10.1007/s10878-012-9541-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9541-4