Abstract
Let G be a connected graph with n vertices. Suppose a fire breaks out at some vertex of G. At each time interval, firefighters can protect up to k vertices, and then the fire spreads to all unprotected neighbors. Let dnk(v) denote the minimum number of vertices that the fire may damage when a fire breaks out at vertex v. The k-expected damage of G, denoted by εk(G), is the expectation of the proportion of vertices that can be damaged from the fire, if the starting vertex of the fire is chosen uniformly at random, i.e., εk(G)=∑v∈V(G)dnk(v)/n2. A class of graphs G is called k-optimal if εk(G) tends to 0 as n tends to infinity for any G∈G. In this paper, we prove that planar graphs of diameter two are 2-optimal, which is the best possible.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.