Cop-win graph
id:
cop-win-graph-234-4391826
title:
Cop-win graph
text:
In graph theory, a cop-win graph is an undirected graph on which the pursuer (cop) can always win a pursuit–evasion game against a robber, with the players taking alternating turns in which they can choose to move along an edge of a graph or stay put, until the cop lands on the robber's vertex. Finite cop-win graphs are also called dismantlable graphs or constructible graphs, because they can be dismantled by repeatedly removing a dominated vertex or constructed by repeatedly adding such a vert
brand slug:
wiki
category slug:
encyclopedia
description:
Type of graph related to pursuit–evasion
original url:
https://en.wikipedia.org/wiki/Cop-win_graph
date created:
date modified:
2023-05-23T03:09:09Z
main entity:
{"identifier":"Q28402476","url":"https://www.wikidata.org/entity/Q28402476"}
image:
fields total:
13
integrity:
14