1 citations · 2 across the 4 of their papers we have counts for
5 papers · 1 filter
Localization and metric dimension for families of highly structured digraphs
Robert F. Bailey, Brittany Pittman
We investigate metric dimension and the localization game for several families of directed analogues of strongly regular graphs and their generalizations, adapting a probabilistic…
The Localization Game on Directed Graphs
Anthony Bonato, Ryan Cushman, Trent G. Marbach +1
In the Localization game played on graphs, a set of cops uses distance probes to identify the location of an invisible robber. We present an extension of the game and its main para…
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 watchman's walk problem on directed graphs
Danny Dyer, Jared Howell, Brittany Pittman
In a graph, a watchman's walk is a minimum closed dominating walk. Given a graph and a single watchman, the length of a watchman's walk in (the watchman number) is denoted…
A note on watchman's walks in de Bruijn graphs
Danny Dyer, Jared Howell, Brittany Pittman
The watchman's walk problem in a digraph calls for finding a minimum length closed dominating walk, where direction of arcs is respected. The watchman's walk of a de Bruijn graph o…