Abstract
Cops and Robbers is a classical pursuit and evasion game in graph theory, which was introduced by Nowakowski and Winkler and independently by Quilliot. In this paper, we study the zero-visibility cops and robber game, which is a variant of Cops and Robbers. In the zero-visibility cops and robber game, the robber is invisible to the cops throughout the game. We introduce a simple method for proving lower bounds on the zero-visibility cop number. This lower bound method is based on a connection between the zero-visibility cop number and the matching number. Using this technique, we investigate graph joins, lexicographic products of graphs, complete multipartite graphs and split graphs. For each of these classes of graphs, we prove lower bounds and upper bounds on the zero-visibility cop number. We also present a linear time approximation algorithm for computing the lexicographic product of a tree and a graph G. The approximation ratio of this algorithm is bounded by \(|V(G)| / (\nu (G) + |V(G) {\setminus } V(\mathcal {M}(G))| )\), where V(G) is the vertex set of G, \(\nu (G)\) is the matching number of G, \(\mathcal {M}(G)\) is a maximum matching of G and \(V(\mathcal {M}(G))\) is the vertex set of \(\mathcal {M}(G)\).
Similar content being viewed by others
References
Aigner M, Fromme M (1984) A game of cops and robbers. Discrete Appl Math 8:1–12
Bienstock D, Seymour P (1991) Monotonicity in graph searching. J Algorithms 12:239–245
Bonato A, MacGillivray G (2017) Characterizations and algorithms for generalized cops and robbers games. Contrib Discrete Math 12(1):110–122
Bonato A, Mohar B (2020) Topological directions in cops and robbers. J Combin 11:47–64
Bonato A, Nowakowski R (2011) The game of cops and robbers on graphs. American Mathematical Society, Providence
Bonato A, Yang B (2013) Graph searching and related problems. In: Pardalos P, Ding-Zhu D, Graham R (eds) Handbook of combinatorial optimization, 2nd edn. Springer, Berlin, pp 1511–1558
Bonato A, Huggan M, Marbach T, McInerney F (2020) The game of cops and eternal robbers. arXiv:2003.03791 [cs.DM]
Bondy JA, Murty USR (2008) Graph theory. Graduate texts in mathematics series. Springer, Berlin
Bradshaw P, Hosseini S.A, Mohar B, Stacho L (2020) On the cop number of graphs of high girth. arXiv:2005.10849 [math.CO
Dereniowski D, Dyer D, Tifenbach R, Yang B (2015a) Zero-visibility cops & robber and the pathwidth of a graph. J Combin Optim 29:541–564
Dereniowski D, Dyer D, Tifenbach R, Yang B (2015b) The complexity of zero-visibility cops and robber. Theoret Comput Sci 607:135–148
Gao Z, Yang B (2019) The one-cop-moves game on planar graphs. J Combin Optim. https://doi.org/10.1007/s10878-019-00417-x
Jeliazkova D (2006) Aspects of the cops and robber game played with incomplete information. Master’s thesis, Acadia University
Kinnersley W (2015) Cops and robbers is EXPTIME-complete. J Combin Theory Ser B 111:201–220
Kirousis LM, Papadimitriou CH (1986) Searching and pebbling. Theoret Comput Sci 47:205–218
Nowakowski R, Winkler P (1983) Vertex to vertex pursuit in a graph. Discrete Math 43:235–239
Quilliot A (1978) Jeux et pointes fixes sur les graphes. Thèse de 3ème cycle, Université de Paris VI, pp 131–145
Tang A (2004) Cops and robber with bounded visibility. Master’s thesis, Dalhousie University
Tošić R (1985) Vertex-to-vertex search in a graph. Graph Theory (Dubrovnik 1985), pp 233–237
Xue Y, Yang B, Zilles S (2019a) New Results on the zero-visibility cops and robber game. In: Proceedings of the 13th international conference on algorithmic aspects in information and management. Lecture notes in computer science 11640. Springer, pp 316–328
Xue Y, Yang B, Zhong F, Zilles S (2019b) A partition approach to lower bounds for zero-visibility cops and robber. In: Proceedings of the 30th international workshop on combinatorial algorithms. Lecture notes in computer science 11638. Springer, pp. 442–454
Yang B, Akter T (2020) Computing the one-visibility copnumber of trees. In: Proceedings of the 14th international conference on algorithmic aspects in information and management. Lecture notes in computer science 12290. Springer, pp 411–423
Yang B, Cao Y (2008) Monotonicity in digraph search problems. Theoret Comput Sci 407:532–544
Yang B, Hamilton W (2015) The optimal capture time of the one-cop-moves game. Theoret Comput Sci 588:96–113
Acknowledgements
The authors would like to thank the anonymous referees for their comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Research of the second author was supported in part by an NSERC Discovery Research Grant, Application No.: RGPIN-2018-06800. Research of the third author was supported in part by an NSERC Discovery Research Grant, Application No.: RGPIN-2017-05336. A preliminary version of this work appears in Proceedings of the 13th International Conference on Algorithmic Aspects in Information and Management (Xue et al. 2019a).
Rights and permissions
About this article
Cite this article
Xue, Y., Yang, B. & Zilles, S. A simple method for proving lower bounds in the zero-visibility cops and robber game. J Comb Optim 43, 1545–1570 (2022). https://doi.org/10.1007/s10878-021-00710-8
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-021-00710-8