The Petersen graph is the smallest 3-cop-win graph

Details The Petersen graph is the smallest 3-cop-win graph The Petersen graph is the smallest 3-cop-win graph

2011-10-04

arxiv.org/abs/1110.0768v2

Mathematics

Combinatorics

14 pages, 3 figures

Scientific paper

In the game of \emph{cops and robbers} on a graph $G = (V,E)$, $k$ cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the robber's turn, he moves similarly. The cops win if there is some time at which a cop is at the same vertex as the robber. Otherwise, the robber wins. The minimum number of cops required to catch the robber is called the \emph{cop number} of $G$, and is denoted $c(G)$. Let $m_k$ be the minimum order of a connected graph satisfying $c(G) \geq k$. Recently, Baird and Bonato determined via computer search that $m_3=10$ and that this value is attained uniquely by the Petersen graph. Herein, we give a self-contained mathematical proof of this result. Along the way, we give some characterizations of graphs with $c(G) >2$ and very high maximum degree.

Affiliated with

Also associated with

No associations

Rating

The Petersen graph is the smallest 3-cop-win graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Petersen graph is the smallest 3-cop-win graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Petersen graph is the smallest 3-cop-win graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-269968