2 citations · 5 across the 10 of their papers we have counts for
30 papers
Iterative models for complex networks formed by extending cliques
Anthony Bonato, Ryan Cushman, Trent G. Marbach +1
We consider a new model for complex networks whose underlying mechanism is extending dense subgraphs. In the frustum model, we iteratively extend cliques over discrete-time steps.…
On Meyniel extremal families of graphs
Anthony Bonato, Ryan Cushman, Trent G. Marbach
We provide new constructions of Meyniel extremal graphs, which are families of graphs with the conjectured largest asymptotic cop number. Using spanning subgraphs, we prove that th…
An improved bound on the burning number of graphs
Anthony Bonato, Shahin Kamali
The burning number conjecture states that the burning number of a connected graph is at most While the conjecture is unresolved, Land and Lu proved that t…
Pursuit-evasion games on latin square graphs
Shreya Ahirwar, Anthony Bonato, Leanna Gittins +3
We investigate various pursuit-evasion parameters on latin square graphs, including the cop number, metric dimension, and localization number. The cop number of latin square graphs…
Small Number of Communities in Twitter Keyword Networks
Linda Abraham, Anthony Bonato, Alexander Nazareth
We investigate networks formed by keywords in tweets and study their community structure. Based on datasets of tweets mined from over seven hundred political figures in the U.S. an…
The localization capture time of a graph
Natalie C. Behague, Anthony Bonato, Melissa A. Huggan +2
The localization game is a pursuit-evasion game analogous to Cops and Robbers, where the robber is invisible and the cops send distance probes in an attempt to identify the locatio…