A note on hyperopic cops and robber

DOI10.1142/S1793830922501270MaRDI QIDQ6174757zbMATH OpenOpenAlexFDO

Authors Nancy E. Clarke, Stephen Finbow, Margaret-Ellen Messinger

Publication date 15 July 2023

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2107.07368

zbMATH Keywords

graph searchingcops and robberpursuit-evasion on graphs

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57)

Abstract: We explore a variant of the game of Cops and Robber introduced by Bonato et al.~where the robber is invisible unless outside the common neighbourhood of the cops. The hyperopic cop number is analogous to the cop number and we investigate bounds on this quantity. We define a small common neighbourhood set and relate the minimum cardinality of this graph parameter to the hyperopic cop number. We consider diameter 2 graphs, particularly the join of two graphs, as well as Cartesian products.

Recommendations

• Hyperopic cops and robbers
• Cops and Robbers on Graphs of Bounded Diameter
• Limited visibility cops and robber
• The role of information in the cop-robber game
• Cops and Robbers on diameter two graphs

Cites work

• scientific article; zbMATH DE number 4064802 (Why is no real title available?)
• scientific article; zbMATH DE number 1792626 (Why is no real title available?)
• A game of cops and robbers
• Hyperopic cops and robbers
• Limited visibility cops and robber
• On the cop number of a graph
• The complexity of zero-visibility cops and robber
• The game of cops and robbers on graphs
• Zero-visibility cops and robber and the pathwidth of a graph

Cited in

(1)

• Hyperopic cops and robbers

This page was built for publication: A note on hyperopic cops and robber

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174757)