A robber locating strategy for trees

DOI10.1016/j.dam.2017.07.019zbMath1372.05138OpenAlexW2745711864MaRDI QIDQ2410225

Yanyan Li

Publication date: 17 October 2017

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

Full work available at URL: https://doi.org/10.1016/j.dam.2017.07.019

zbMATH Keywords

treescops and robbersrobber locating game

Mathematics Subject Classification ID

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

Related Items (14)

Localization game on geometric and planar graphs ⋮ Approximately locating an invisible agent in a graph with relative 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 ⋮ Locating a backtracking robber on a tree ⋮ Centroidal localization game ⋮ The localization game on Cartesian products ⋮ Sequential metric dimension ⋮ Localization game for random graphs ⋮ Localization game for random geometric graphs ⋮ The localization capture time of a graph

Cites Work

• An evasion game on a graph
• The robber locating game
• Locating a robber on a graph
• Graph searching and a min-max theorem for tree-width
• Vertex-to-vertex pursuit in a graph
• Locating a robber on a graph via distance queries
• Locating a backtracking robber on a tree
• Subdivisions in the robber locating game
• Recontamination does not help to search a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A robber locating strategy for trees