Localization game for random graphs
From MaRDI portal
Publication:2065786
DOI10.1016/j.dam.2021.12.002zbMath1480.05092arXiv1910.11225MaRDI QIDQ2065786
Andrzej Dudek, Paweł Prałat, Calum MacRury, Sean English, Alan M. Frieze
Publication date: 13 January 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.11225
05C80: Random graphs (graph-theoretic aspects)
91A43: Games involving graphs
91A24: Positional games (pursuit and evasion, etc.)
05C57: Games on graphs (graph-theoretic aspects)
05C42: Density (toughness, etc.)
Related Items
The localization game on oriented graphs, Edge and pair queries-random graphs and complexity, Localization game for random geometric graphs, The localization capture time of a graph
Cites Work
- Metric dimension for random graphs
- Centroidal localization game
- Locating a robber on a graph
- Localization game on geometric and planar graphs
- A note on the localization number of random graphs: diameter two case
- Locating a robber on a graph via distance queries
- A robber locating strategy for trees
- Locating a robber with multiple probes
- Locating a backtracking robber on a tree
- Paths in graphs
- Sequential metric dimension for random graphs
- Bounds on the localization number
- Sequential metric dimension
- Unnamed Item
- Unnamed Item
- Unnamed Item