2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2024
Graph Burning On Large -Caterpillars
Danielle Cox, M. E. Messinger, Kerry Ojakian
Graph burning models the spread of information or contagion in a graph. At each time step, two events occur: neighbours of already burned vertices become burned, and a new vertex i…
math.CO2024
Deduction, Constrained Zero Forcing, and Constrained Searching
Andrea Burgess, Danny Dyer, Kerry Ojakian +3
Deduction is a recently introduced graph searching process in which searchers clear the vertex set of a graph with one move each, with each searcher's movement determined by which…
math.CO2016★ 2 cited
Cop-Win Graphs: Optimal Strategies and Corner Rank
David Offner, Kerry Ojakian
We investigate the game of cops and robber, played on a finite graph, between one cop and one robber. If the cop can force a win on a graph, the graph is called cop-win. We describ…