1 citations · 1 across the 6 of their papers we have counts for
11 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…
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…
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…
Progress on the localization number of a graph
Anthony Bonato, Melissa A. Huggan, Trent G. Marbach
We highlight new results on the localization number of a graph, a parameter derived from the localization graph searching game. After introducing the game and providing an overview…
The iterated local transitivity model for hypergraphs
Natalie C. Behague, Anthony Bonato, Melissa A. Huggan +2
Complex networks are pervasive in the real world, capturing dyadic interactions between pairs of vertices, and a large corpus has emerged on their mining and modeling. However, man…