The game of Cops and Robber on circulant graphs
From MaRDI portal
Publication:528556
DOI10.1016/J.DAM.2017.03.004zbMATH Open1361.05081OpenAlexW2607431919MaRDI QIDQ528556FDOQ528556
Authors: S. L. Fitzpatrick, John Paul Larkin 
Publication date: 12 May 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.03.004
Recommendations
Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- On the cop number of a graph
- Vertex-to-vertex pursuit in a graph
- A survey on multi-loop networks.
- Cops and robbers in a random graph
- On Meyniel's conjecture of the cop number
- The game of cops and robbers on graphs
- Title not available (Why is that?)
- PRODUCTS OF CIRCULANT GRAPHS
- A game of cops and robbers
- A game of cops and robbers played on products of graphs
- Efficient domination in circulant graphs
- Cops and robbers is EXPTIME-complete
- Tandem-win graphs
- On a pursuit game on Cayley graphs
- On the domination number of the circulant graphs \(C(n;\{1,2\})\), \(C(n;\{1,3\})\) and \(C(n;\{1,4\})\).
- Title not available (Why is that?)
Cited In (8)
- Chasing a drunk robber in many classes of graphs
- Cops and Robbers on Graphs of Bounded Diameter
- Title not available (Why is that?)
- Generalized cops and robbers: a multi-player pursuit game on graphs
- On the Capture Time of Cops and Robbers Game on a Planar Graph
- TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS
- Cops and Robber game with a fast robber on expander graphs and random graphs
- The impact of loops on the game of cops and robbers on graphs
This page was built for publication: The game of Cops and Robber on circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528556)
