Capture-Time Extremal Cop-Win Graphs
We investigate extremal graphs related to the game of Cops and Robbers. We focus on graphs where a single cop can catch the robber; such graphs are called cop-win. The capture time of a cop-win graph is the minimum number of moves the cop needs to capture the robber. We consider graphs that are extr...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2021-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2224 |