TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS

DOI10.17654/DM027010039zbMath1499.05421arXiv2004.00606OpenAlexW3164239592MaRDI QIDQ5076122

Rade Stoisavljevic, Pamela E. Harris, Erik Insko, Shaun Sullivan, Alicia Prieto-Langarica

Publication date: 16 May 2022

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.00606

zbMATH Keywords

pursuit-evasion games on graphscop and robber game on graphs

Mathematics Subject Classification ID

Games involving graphs (91A43) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Positional games (pursuit and evasion, etc.) (91A24) Cell movement (chemotaxis, etc.) (92C17) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Capturing the drunk robber on a graph
• A game of cops and robbers
• The capture time of a graph
• On the cop number of a graph
• Some results about pursuit games on metric spaces obtained through graph theory techniques
• Vertex-to-vertex pursuit in a graph
• On cop-win graphs
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Collisions Among Random Walks on a Graph
• Maximum hitting time for random walks on graphs

This page was built for publication: TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS