Surviving rate of graphs and Firefighter Problem

Wang, Weifan; Kong, Jiangxu

doi:10.1007/s11464-022-1009-y

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2023

Publication Types

Select...

Article2

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 61 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There is a considerable amount of literature on the algorithms of firefighting and complexity. Further information on firefighting can be found in the latest survey article by Wang and Kong [5]. Moreover, firefighting modeling has many applications in computer science, biology, the spread of epidemics, etc.…”

Section: Introductionmentioning

confidence: 99%

The Surviving Rate of IC-Planar Graphs

Kong

2022

Symmetry

Self Cite

View full text Add to dashboard Cite

Let k and n be two positive integers. Firefighting is a discrete dynamical process of preventing the spread of fire. Let G be a connected graph G with n vertices. Assuming a fire starts at one of the vertices of G, the firefighters choose k unburned vertices at each step, and then the fire spreads to all unprotected neighbors of the burning vertices. The process continues until the fire stops spreading. The goal is to protect as many vertices as possible. When a fire breaks out randomly at a vertex of G, its k-surviving rate, ρk(G), is the expected number of saved vertices. A graph is IC-planar if it has a drawing in which each edge cross once and their endpoints are disjoint. In this paper, we prove that ρ4(G)>1124 for every IC-planar graph G. This is proven by the discharging method and the locally symmetric of the graph.

show abstract

Section: Introductionmentioning

confidence: 99%