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

被引:5
作者
Wu, Tingting [1 ]
Kong, Jiangxu [2 ]
Wang, Weifan [1 ]
机构
[1] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
[2] Xiamen Univ, Sch Math Sci, Xiamen 361005, Fujian, Peoples R China
关键词
Firefighter problem; Surviving rate; Cycle; Planar graph; FIREFIGHTER PROBLEM; SURVIVING RATE;
D O I
10.1007/s10878-015-9835-4
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Let be a connected graph with vertices. Let be an integer. Suppose that a fire breaks out at a vertex of . A firefighter starts to protect vertices. At each step, the firefighter protects -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 denote the maximum number of vertices in that the firefighter can save when a fire breaks out at vertex . The -surviving rate of is defined to be , which is the average proportion of saved vertices. In this paper, we prove that if is a planar graph with vertices and without 5-cycles, then rho(2)(G) > 1/363.
引用
收藏
页码:1479 / 1492
页数:14
相关论文
共 19 条
[1]  
[Anonymous], 1995, P 25 MAN C COMB MATH
[2]   The firefighter problem with more than one firefighter on trees [J].
Bazgan, Cristina ;
Chopin, Morgan ;
Ries, Bernard .
DISCRETE APPLIED MATHEMATICS, 2013, 161 (7-8) :899-908
[3]   SURVIVING RATES OF GRAPHS WITH BOUNDED TREEWIDTH FOR THE FIREFIGHTER PROBLEM [J].
Cai, Leizhen ;
Cheng, Yongxi ;
Verbin, Elad ;
Zhou, Yuan .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (04) :1322-1335
[4]   THE SURVIVING RATE OF A GRAPH FOR THE FIREFIGHTER PROBLEM [J].
Cai Leizhen ;
Wang Weifan .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (04) :1814-1826
[5]   More fires and more fighters [J].
Costa, Vitor ;
Dantas, Simone ;
Dourado, Mitre C. ;
Penso, Lucia ;
Rautenbach, Dieter .
DISCRETE APPLIED MATHEMATICS, 2013, 161 (16-17) :2410-2419
[6]   Fire Containment in Planar Graphs [J].
Esperet, Louis ;
van den Heuvel, Jan ;
Maffray, Frederic ;
Sipma, Felix .
JOURNAL OF GRAPH THEORY, 2013, 73 (03) :267-279
[7]   The firefighter problem for graphs of maximum degree three [J].
Finbow, Stephen ;
King, Andrew ;
MacGillivray, Gary ;
Rizzi, Romeo .
DISCRETE MATHEMATICS, 2007, 307 (16) :2094-2105
[8]  
Finbow S, 2009, AUSTRALAS J COMB, V43, P57
[9]  
FOGARTY P, 2003, THESIS U VERMONT
[10]  
Gordinowicz P, 2013, ARXIV13111158V1MATHC