The localization game on oriented graphs
DOI10.1016/j.dam.2023.06.003zbMath1519.05172arXiv2208.07788OpenAlexW4380928971MaRDI QIDQ6110602
Brittany Pittman, Ryan Cushman, Trent G. Marbach, Anthony Bonato
Publication date: 2 August 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.07788
hypergraphstournamentsoriented graphsrandom tournamentsPaley tournamentsstrong componentslocalization numberquasi-random tournaments
Random graphs (graph-theoretic aspects) (05C80) Linear programming (90C05) Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metric dimension for random graphs
- The dag-width of directed graphs
- Centroidal localization game
- Locating a robber on a graph
- The metric dimension of Cayley digraphs
- On the ratio of optimal integral and fractional covers
- Localization game on geometric and planar graphs
- A note on the localization number of random graphs: diameter two case
- Vertex-to-vertex pursuit in a graph
- On the evolution of a random tournament
- Locating a robber on a graph via distance queries
- On the metric dimension of line graphs
- Resolving sets and semi-resolving sets in finite projective planes
- Symmetry breaking in tournaments
- Localization game for random graphs
- Localization game for random geometric graphs
- The localization capture time of a graph
- A robber locating strategy for trees
- Doubly regular tournaments are equivalent to skew Hadamard matrices
- The directed distance dimension of oriented graphs
- Almost all Tournaments are Irreducible
- Quasi-random tournaments
- An Invitation to Pursuit-Evasion Games and Graph Theory
- Digraphs
- Metric dimension: from graphs to oriented graphs
This page was built for publication: The localization game on oriented graphs
