# Lions and contamination, triangular grids, and Cheeger constants

Suppose each vertex of a graph is originally occupied by contamination, except for those vertices occupied by lions. As the lions wander on the graph, they clear the contamination from each vertex they visit. However, the contamination simultaneously spreads to any adjacent vertex not occupied by a lion. How many lions are required in order to clear the graph of contamination? We give a lower bound on the number of lions needed in terms of the Cheeger constant of the graph. Furthermore, the lion and contamination problem has been studied in detail on square grid graphs by Brass et al. and Berger et al., and we extend this analysis to the setting of triangular grid graphs.

There are no comments yet.

## Authors

• 9 publications
• 1 publication
• 1 publication
• ### A method for eternally dominating strong grids

In the eternal domination game, an attacker attacks a vertex at each tur...
03/03/2020 ∙ by Alizée Gagnon, et al. ∙ 0

• ### 4-connected planar graphs are in B_3-EPG

We show that every 4-connected planar graph has a B_3-EPG representation...
10/12/2017 ∙ by Therese Biedl, et al. ∙ 0

• ### The Connected Domination Number of Grids

Closed form expressions for the domination number of an n × m grid have ...
11/23/2020 ∙ by Adarsh Srinivasan, et al. ∙ 0

• ### Bounds on expected propagation time of probabilistic zero forcing

Probabilistic zero forcing is a coloring game played on a graph where th...
09/10/2019 ∙ by Shyam Narayanan, et al. ∙ 0

• ### Routing by matching on convex pieces of grid graphs

The routing number is a graph invariant introduced by Alon, Chung, and G...
06/20/2021 ∙ by H. Alpert, et al. ∙ 0

• ### No additional tournaments are quasirandom-forcing

A tournament H is quasirandom-forcing if the following holds for every s...
12/09/2019 ∙ by Robert Hancock, et al. ∙ 0