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...
Wedi'i Gadw mewn:
| Prif Awduron: | , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
University of Zielona Góra
2021-11-01
|
| Cyfres: | Discussiones Mathematicae Graph Theory |
| Pynciau: | |
| Mynediad Ar-lein: | https://doi.org/10.7151/dmgt.2224 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|