Abstract
In this paper, 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 neighborhood 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 neighborhood set and relate the minimum cardinality of this graph parameter to the hyperopic cop number. We consider diameter [Formula: see text] graphs, particularly the join of two graphs, as well as Cartesian products.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
