1 citations · 1 across the 1 of their papers we have counts for
4 papers
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…
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…
Tight Bounds on the Probabilistic Zero Forcing on Hypercubes and Grids
Natalie C. Behague, Trent Marbach, Pawel Pralat
Zero forcing is a deterministic iterative graph colouring process in which vertices are coloured either blue or white, and in every round, any blue vertices that have a single whit…
Semi-perfect 1-Factorizations of the Hypercube
Natalie C. Behague
A 1-factorization of a graph is called perfect if the union of any pair of 1-factors with is a Hamilton cycle. It is…