Locating a robber on a graph

DOI10.1016/j.disc.2012.07.029zbMath1250.91020OpenAlexW1984405480MaRDI QIDQ713142

Suzanne M. Seager

Publication date: 26 October 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.07.029

zbMATH Keywords

robbergraph gamelocating

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (22)

Localization game on geometric and planar graphs ⋮ Subdivisions in the robber locating game ⋮ Approximately locating an invisible agent in a graph with relative distance queries ⋮ A robber locating strategy for trees ⋮ An evasion game on a graph ⋮ Locating a robber with multiple probes ⋮ Locating a robber on a graph via distance queries ⋮ The one-visibility localization game ⋮ The localization game on oriented graphs ⋮ The localization number of designs ⋮ The cat and the noisy mouse ⋮ Unnamed Item ⋮ A note on the localization number of random graphs: diameter two case ⋮ On the status sequences of trees ⋮ Locating a backtracking robber on a tree ⋮ Centroidal localization game ⋮ The localization game on Cartesian products ⋮ The robber locating game ⋮ Sequential metric dimension ⋮ Localization game for random graphs ⋮ Localization game for random geometric graphs ⋮ The localization capture time of a graph

Cites Work

• An annotated bibliography on guaranteed graph searching
• Vertex-to-vertex pursuit in a graph
• Locating a robber on a graph via distance queries
• On the Metric Dimension of Cartesian Products of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Locating a robber on a graph