The localization number of designs
From MaRDI portal
Publication:6188118
DOI10.1002/jcd.21762arXiv2005.12780OpenAlexW3111952666MaRDI QIDQ6188118
Trent G. Marbach, Melissa Huggan, Anthony Bonato
Publication date: 1 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.12780
incidence graphsprojective planesSteiner systemsbalanced incomplete block designslocalization number
Combinatorial aspects of block designs (05B05) Games involving graphs (91A43) Finite affine and projective planes (geometric aspects) (51E15) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Centroidal localization game
- Locating a robber on a graph
- An annotated bibliography on guaranteed graph searching
- Cops and robbers in graphs with large girth and Cayley graphs
- Nearly perfect matchings in regular simple hypergraphs
- Localization game on geometric and planar graphs
- A note on the localization number of random graphs: diameter two case
- On the metric dimension of incidence graphs
- Locating a robber on a graph via distance queries
- Resolving sets and semi-resolving sets in finite projective planes
- Topological directions in cops and robbers
- A robber locating strategy for trees
- Locating a robber with multiple probes
- Locating a backtracking robber on a tree
- Cops and Robbers on Graphs Based on Designs
- Combinatorial Designs
- Bounds on the localization number