Abstract
The firefighter problem is a game played on a connected graph where a fire breaks out at a vertex. In each round, a firefighter chooses a vertex to protect, and the fire then spreads to all unprotected neighbors of the burning vertex. This sequence continues until the fire can no longer spread. The objective is to maximize the number of saved vertices, necessitating a strategic approach by the firefighter. This problem serves as a simplistic model for scenarios such as disease spread in a network or people’s movement under specific circumstances. To simulate a scenario with limited resources, we introduce a new firefighter method, involving the protection of one vertex and subdividing one edge. This method, achieved by adding a new vertex to the edge, effectively delays the burning of the vertex connected to the edge, providing additional time for the firefighter to protect it. Our investigation delves into the firefighter problem with subdividing edges, focusing on specific graphs. Notably, we present an optimal strategy for a graph with a maximum degree at most three.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AKCE International Journal of Graphs and Combinatorics
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.
