The damage throttling number of a graph
From MaRDI portal
Publication:5000318
zbMath1468.05180arXiv2006.10894MaRDI QIDQ5000318
Preetul Sen, Robin Eagleton, Carolyn Reinhart, Joshua Carlson, John Petrucci, Jesse T. Geneson
Publication date: 12 July 2021
Full work available at URL: https://arxiv.org/abs/2006.10894
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (4)
Games on Graphs: Cop and Robber, Hungry Spiders, and Broadcast Domination ⋮ Unnamed Item ⋮ Unnamed Item ⋮ damage_throttling
Uses Software
Cites Work
- Throttling for the game of cops and robbers on graphs
- A game of cops and robbers
- Cop-win graphs with maximum capture-time
- The capture time of a graph
- Cops and robbers in graphs with large girth and Cayley graphs
- Vertex-to-vertex pursuit in a graph
- The game of overprescribed Cops and Robbers played on graphs
- Graph Theory
- Unnamed Item
- Unnamed Item
This page was built for publication: The damage throttling number of a graph