A note on hyperopic cops and robber

DOI10.1142/S1793830922501270zbMATH Open1516.05142arXiv2107.07368OpenAlexW3178936237MaRDI QIDQ6174757FDOQ6174757

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)

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.

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

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

zbMATH Keywords

graph searchingcops and robberpursuit-evasion on graphs

Mathematics Subject Classification ID

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

Cites Work

• On the cop number of a graph
• The game of cops and robbers on graphs
• A game of cops and robbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hyperopic cops and robbers
• The complexity of zero-visibility cops and robber
• Zero-visibility cops and robber and the pathwidth of a graph
• Limited visibility cops and robber

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)