DeepAI AI Chat
Log In Sign Up

Lions and contamination, triangular grids, and Cheeger constants

by   Henry Adams, et al.

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.


page 1

page 2

page 3

page 4


A method for eternally dominating strong grids

In the eternal domination game, an attacker attacks a vertex at each tur...

4-connected planar graphs are in B_3-EPG

We show that every 4-connected planar graph has a B_3-EPG representation...

The Connected Domination Number of Grids

Closed form expressions for the domination number of an n × m grid have ...

Bounds on expected propagation time of probabilistic zero forcing

Probabilistic zero forcing is a coloring game played on a graph where th...

Routing by matching on convex pieces of grid graphs

The routing number is a graph invariant introduced by Alon, Chung, and G...

Bounds on Functionality and Symmetric Difference – Two Intriguing Graph Parameters

[Alecu et al.: Graph functionality, JCTB2021] define functionality, a gr...

Finding popular branchings in vertex-weighted digraphs

Popular matchings have been intensively studied recently as a relaxed co...