The game of Cops and Robber on circulant graphs

DOI10.1016/j.dam.2017.03.004zbMath1361.05081OpenAlexW2607431919MaRDI QIDQ528556

Shannon 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

zbMATH Keywords

pursuit-evasion gamecirculant graphCops and Robber

Mathematics Subject Classification ID

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

Related Items (1)

Chasing a drunk robber in many classes of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• On a pursuit game on Cayley graphs
• On the cop number of a graph
• A game of cops and robbers played on products of graphs
• Vertex-to-vertex pursuit in a graph
• A survey on multi-loop networks.
• Efficient domination in circulant graphs
• Cops and robbers in a random graph
• Cops and robbers is EXPTIME-complete
• Tandem-win graphs
• On Meyniel's conjecture of the cop number
• PRODUCTS OF CIRCULANT GRAPHS

This page was built for publication: The game of Cops and Robber on circulant graphs