Lazy Cops and Robbers on generalized hypercubes

DOI10.1016/J.DISC.2016.09.031zbMATH Open1361.05082OpenAlexW2551880559MaRDI QIDQ526267FDOQ526267

Kai An Sim, K. B. Wong, Ta Sheng Tan

Publication date: 10 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.09.031

zbMATH Keywords

hypercubesvertex-pursuit gamesCops and Robbers

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Cites Work

• Cops and robbers in graphs with large girth and Cayley graphs
• Vertex-to-vertex pursuit in a graph
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Title not available (Why is that?)
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• A game of cops and robbers
• Title not available (Why is that?)
• Variations of cops and robber on the hypercube
• Lazy cops and robbers played on random graphs and graphs on surfaces
• Lazy Cops and Robbers on Hypercubes
• Combinatorial properties of generalized hypercube graphs
• Two characterizations of generalized hypercube

Cited In (4)

• Connected Search for a Lazy Robber
• Variations of cops and robbers game on grids
• The one-cop-moves game on planar graphs
• Connected search for a lazy robber

This page was built for publication: Lazy Cops and Robbers on generalized hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526267)