A lower bound of the surviving rate of a planar graph with girth at least seven

Weifan Wang (), Stephen Finbow and Ping Wang
Additional contact information
Weifan Wang: Zhejiang Normal University
Stephen Finbow: St. Francis Xavier University
Ping Wang: St. Francis Xavier University

Journal of Combinatorial Optimization, 2014, vol. 27, issue 4, No 1, 642 pages

Abstract: 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}$ .

Keywords: Firefighter problem; Surviving rate; Planar graphs; Girth (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9541-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:27:y:2014:i:4:d:10.1007_s10878-012-9541-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9541-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().