A note on the surviving rate of 1-planar graphs

被引:6
|
作者
Kong, Jiangxu [1 ,2 ]
Zhang, Lianzhu [2 ]
机构
[1] China Jiliang Univ, Dept Math, Hangzhou 310018, Zhejiang, Peoples R China
[2] Xiamen Univ, Sch Math Sci, Xiamen 361005, Fujian, Peoples R China
关键词
Firefighter problem; Surviving rate; 1-planar graph; PLANAR GRAPHS; FIREFIGHTER PROBLEM; 2-SURVIVING RATE; EDGE; FIRE;
D O I
10.1016/j.disc.2016.11.005
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For a connected graph G, suppose that a fire breaks out at its vertex and a firefighter starts to protect vertices. At each time interval, the firefighter protects k vertices 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. The k-surviving rate rho k(G) of G is defined to be the expected percentage of vertices saved if the fire breaks out at a random vertex. In this note, we consider the surviving rate of 1-planar graphs, and show that every 1-planar graph G has rho 6(G) > 1/163. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:1074 / 1079
页数:6
相关论文
共 50 条
  • [1] The surviving rate of planar graphs
    Kong, Jiangxu
    Wang, Weifan
    Zhu, Xuding
    THEORETICAL COMPUTER SCIENCE, 2012, 416 : 65 - 70
  • [2] Structural properties and surviving rate of planar graphs
    Kong, Jiangxu
    Zhang, Lianzhu
    Wang, Weifan
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (04)
  • [3] On the Pagenumber of 1-Planar Graphs
    Guan, Xiaxia
    Yang, Weihua
    CHINESE ANNALS OF MATHEMATICS SERIES B, 2025, 46 (02) : 287 - 302
  • [4] On (p, 1)-total labelling of 1-planar graphs
    Zhang, Xin
    Yu, Yong
    Liu, Guizhen
    CENTRAL EUROPEAN JOURNAL OF MATHEMATICS, 2011, 9 (06): : 1424 - 1434
  • [5] The 2-surviving rate of planar graphs without 6-cycles
    Wang, Weifan
    Finbow, Stephen
    Kong, Jiangxu
    THEORETICAL COMPUTER SCIENCE, 2014, 518 : 22 - 31
  • [6] On total colorings of 1-planar graphs
    Zhang, Xin
    Hou, Jianfeng
    Liu, Guizhen
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 30 (01) : 160 - 173
  • [7] On RAC drawings of 1-planar graphs
    Bekos, Michael A.
    Didimo, Walter
    Liotta, Giuseppe
    Mehrabi, Saeed
    Montecchiani, Fabrizio
    THEORETICAL COMPUTER SCIENCE, 2017, 689 : 48 - 57
  • [8] The Vertex Arboricity of 1-Planar Graphs
    Zhang, Dongdong
    Liu, Juan
    Li, Yongjie
    Yang, Hehua
    GRAPHS AND COMBINATORICS, 2024, 40 (05)
  • [9] On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs
    Hu, Dai-Qiang
    Wu, Jian-Liang
    Yang, Donglei
    Zhang, Xin
    GRAPHS AND COMBINATORICS, 2017, 33 (04) : 945 - 953
  • [10] On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs
    Dai-Qiang Hu
    Jian-Liang Wu
    Donglei Yang
    Xin Zhang
    Graphs and Combinatorics, 2017, 33 : 945 - 953