Acknowledgement
Supported by : University of Malaya
References
- M. Aigner and M. Fromme, A game of cops and robbers, Discrete Appl. Math. 8 (1984), no. 1, 1-11. https://doi.org/10.1016/0166-218X(84)90073-8
- W. Baird, A. Beveridge, A. Bonato, P. Codenotti, A. Maurer, J. Mccauley, and S. Valeya, On the minimum order of k-cop-win graphs, Contrib. Discrete Math. 9 (2014), no. 1, 70-84.
- A. Bonato, E. Chiniforooshan, and P. Pralat, Cops and Robbers from a distance, Theoret. Comput. Sci. 411 (2010), no. 43, 3834-3844. https://doi.org/10.1016/j.tcs.2010.07.003
- R. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Math. 43 (1983), no. 2-3, 235-239. https://doi.org/10.1016/0012-365X(83)90160-7
- D. Offner and K. Ojakian, Variations of cops and robber on the hypercube, Australas. J. Combin. 59 (2014), 229-250.
- A. Quilliot, Jeux et pointes fixes sur les graphes. These de 3eme cycle, Universite de Paris VI (1978), 131-145.
-
B. W. Sullivan, N. Townsend, and M. Werzanski, The 3
${\times}$ 3 rooks graph (K32K3) is the unique smallest graph with lazy cop number 3, arXiv: 1606.08485(2016). - B. W. Sullivan, N. Townsend, and M. Werzanski, An introduction to lazy cops and robbers on graphs, College Math. J. 48 (2017), no. 5, 322-333. https://doi.org/10.4169/college.math.j.48.5.322