Abstract

We study the zero-visibility cops and robber game, a variant of the cops and robber game in which the robber is invisible. We give a method for proving lower bounds on the zero-visibility cop number. Using this method, we investigate graph joins, lexicographic products of graphs, complete multipartite graphs and split graphs. Lower bounds and upper bounds, along with rigorous proofs, are given for the zero-visibility cop number of each of these types of graphs.

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 call

Disclaimer: 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.