The 2-surviving rate of planar graphs without 5-cycles

Tingting Wu, Jiangxu Kong and Weifan Wang ()
Additional contact information
Tingting Wu: Zhejiang Normal University
Jiangxu Kong: Xiamen University
Weifan Wang: Zhejiang Normal University

Journal of Combinatorial Optimization, 2016, vol. 31, issue 4, No 9, 1479-1492

Abstract: Abstract Let $$G$$ G be a connected graph with $$n\ge 2$$ n ≥ 2 vertices. Let $$k\ge 1$$ k ≥ 1 be an integer. Suppose that a fire breaks out at a vertex $$v$$ v of $$G$$ G . A firefighter starts to protect vertices. At each step, the firefighter protects $$k$$ k -vertices not yet on fire. At the end of each step, the fire spreads to all the unprotected vertices that have a neighbour on fire. Let $$\hbox {sn}_k(v)$$ sn k ( v ) denote the maximum number of vertices in $$G$$ G that the firefighter can save when a fire breaks out at vertex $$v$$ v . The $$k$$ k -surviving rate $$\rho _k(G)$$ ρ k ( G ) of $$G$$ G is defined to be $$\frac{1}{n^2}\sum _{v\in V(G)} {\hbox {sn}}_{k}(v)$$ 1 n 2 ∑ v ∈ V ( G ) sn k ( v ) , which is the average proportion of saved vertices. In this paper, we prove that if $$G$$ G is a planar graph with $$n\ge 2$$ n ≥ 2 vertices and without 5-cycles, then $$\rho _2(G)>\frac{1}{363}$$ ρ 2 ( G ) > 1 363 .

Keywords: Firefighter problem; Surviving rate; Cycle; Planar graph (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9835-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:31:y:2016:i:4:d:10.1007_s10878-015-9835-4

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

DOI: 10.1007/s10878-015-9835-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 ().