Graph burning studies how fast a contagion, modeled as set of fires, spreads in graph. The process takes place synchronous, discrete rounds. In each round, fire breaks out at vertex, and the to all vertices that are adjacent vertex. number graph G is minimum rounds necessary for vertex burn. We consider \(m \times n\) Cartesian grid graphs, written \(G_{m,n}\). For = \omega (\sqrt{n})\), asympt...

The fencing of protected areas is increasing worldwide. However, the implementation fences for conservation has outpaced scientific assessment their effectiveness, non-target impacts, and long-term costs. We assessed landscape predictors fence crossing sites employed camera traps over a one-year period to investigate wildlife responses around Lake Nakuru National Park, Kenya. Specifically, we m...