32 citations · 117 across the 58 of their papers we have counts for
6 papers · 1 filter
A survey of graph burning
Anthony Bonato
Graph burning is a deterministic, discrete-time process that models how influence or contagion spreads in a graph. Associated to each graph is its burning number, which is a parame…
The localization number and metric dimension of graphs of diameter 2
Anthony Bonato, Melissa A. Huggan, Trent Marbach
We consider the localization number and metric dimension of certain graphs of diameter , focusing on families of Kneser graphs and graphs without 4-cycles. For the Kneser graphs…
The localization number of designs
Anthony Bonato, Melissa A. Huggan, Trent Marbach
We study the localization number of incidence graphs of designs. In the localization game played on a graph, the cops attempt to determine the location of an invisible robber via d…
The Game of Cops and Eternal Robbers
Anthony Bonato, Melissa Huggan, Trent Marbach +1
We introduce the game of Cops and Eternal Robbers played on graphs, where there are infinitely many robbers that appear sequentially over distinct plays of the game. A positive int…
Iterated Global Models for Complex Networks
Anthony Bonato, Erin Meger
We introduce the Iterated Global model as a deterministic graph process that simulates several properties of complex networks. In this model, for every set of nodes of a prescr…
Probabilistically Faulty Searching on a Half-Line
Anthony Bonato, Konstantinos Georgiou, Calum MacRury +1
We study -Faulty Search, a variant of the classic cow-path optimization problem, where a unit speed robot searches the half-line (or -ray) for a hidden item. The searcher is…