Skip to main content Accessibility help
×
Home
Hostname: page-component-65dc7cd545-fnzx6 Total loading time: 0.172 Render date: 2021-07-25T00:30:37.884Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

Lazy Cops and Robbers on Hypercubes

Published online by Cambridge University Press:  29 January 2015

DEEPAK BAL
Affiliation:
Department of Mathematics, Ryerson University, Toronto, ON, Canada, M5B 2K3 (e-mail: deepak.c.bal@ryerson.ca, abonato@ryerson.ca, pralat@ryerson.ca)
ANTHONY BONATO
Affiliation:
Department of Mathematics, Ryerson University, Toronto, ON, Canada, M5B 2K3 (e-mail: deepak.c.bal@ryerson.ca, abonato@ryerson.ca, pralat@ryerson.ca)
WILLIAM B. KINNERSLEY
Affiliation:
Department of Mathematics, University of Rhode Island, Kingston, RI, USA, 02881 (e-mail: billk@mail.uri.edu)
PAWEŁ PRAŁAT
Affiliation:
Department of Mathematics, Ryerson University, Toronto, ON, Canada, M5B 2K3 (e-mail: deepak.c.bal@ryerson.ca, abonato@ryerson.ca, pralat@ryerson.ca)

Abstract

We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we call the lazy cop number. Lazy Cops and Robbers was recently introduced by Offner and Ojakian, who provided asymptotic upper and lower bounds on the lazy cop number of the hypercube. By coupling the probabilistic method with a potential function argument, we improve on the existing lower bounds for the lazy cop number of hypercubes.

MSC classification

Type
Paper
Copyright
Copyright © Cambridge University Press 2015 

Access options

Get access to the full version of this content by using one of the access options below.

References

[1] Aigner, M. and Fromme, M. (1984) A game of cops and robbers. Discrete Appl. Math. 8 112.CrossRefGoogle Scholar
[2] Alon, N. and Mehrabian, A. Chasing a fast robber on planar graphs and random graphs. J. Graph Theory, to appear.Google Scholar
[3] Baird, W. and Bonato, A. (2012) Meyniel's conjecture on the cop number: A survey. J. Combinatorics 3 225238.CrossRefGoogle Scholar
[4] Bonato, A. (2011) Catch me if you can: Cops and Robbers on graphs. In Proc. 6th International Conference on Mathematical and Computational Models: ICMCM'11.Google Scholar
[5] Bonato, A. (2012) WHAT IS . . . Cop Number? Notices Amer. Math. Soc. 59 11001101.CrossRefGoogle Scholar
[6] Bonato, A. and Chiniforooshan, E. (2009) Pursuit and evasion from a distance: algorithms and bounds. In Proc. ANALCO'09.Google Scholar
[7] Bonato, A., Chiniforooshan, E. and Prałat, P. (2010) Cops and Robbers from a distance. Theoret. Comput. Sci. 411 38343844.CrossRefGoogle Scholar
[8] Bonato, A., Finbow, S., Gordinowicz, P., Haidar, A., Kinnersley, W. B., Mitsche, D., Prałat, P. and Stacho, L. (2013) The robber strikes back. In Proc. International Conference on Computational Intelligence, Cyber Security and Computational Models: ICC3.Google Scholar
[9] Bonato, A. and Nowakowski, R. J. (2011) The Game of Cops and Robbers on Graphs, AMS.CrossRefGoogle Scholar
[10] Dudek, A., Gordinowicz, P. and Prałat, P. (2014) Cops and Robbers playing on edges. J. Combinatorics 5 131153.CrossRefGoogle Scholar
[11] Frieze, A., Krivelevich, M. and Loh, P. (2012) Variations on Cops and Robbers. J. Graph Theory 69 383402.CrossRefGoogle Scholar
[12] Kehagias, A., Mitsche, D. and Prałat, P. (2013) Cops and Invisible Robbers: The cost of drunkenness. Theoret. Comput. Sci. 481 100120.CrossRefGoogle Scholar
[13] Kehagias, A. and Prałat, P. (2012) Some Remarks on Cops and Drunk Robbers. Theoret. Comput. Sci. 463 133147.CrossRefGoogle Scholar
[14] Nowakowski, R. J. and Winkler, P. (1983) Vertex-to-vertex pursuit in a graph. Discrete Math. 43 235239.CrossRefGoogle Scholar
[15] Offner, D. and Okajian, K. (2014) Variations of Cops and Robber on the hypercube. Australasian J. Combinatorics 59 229250.Google Scholar
[16] Quilliot, A. (1978) Jeux et pointes fixes sur les graphes. Thèse de 3ème cycle, Université de Paris VI, pp. 131–145.Google Scholar
[17] West, D. B. (2001) Introduction to Graph Theory, second edition, Prentice Hall.Google Scholar
11
Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Lazy Cops and Robbers on Hypercubes
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Lazy Cops and Robbers on Hypercubes
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Lazy Cops and Robbers on Hypercubes
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *