Improved bounds for the lazy cops and robbers on generalized hypercubes

Anand Babu, Ashwin Jacob, Karunakaran Murali Krishnan +2

In Lazy Cops and Robbers, at most one cop moves on each cop turn. We study the lazy cop number of the generalized hypercube $Q(n,m)$, whose vertex set is ${\{0,1,\dots ,m\}}^n$. Fo…