Name
Abstract | ||
|---|---|---|
In this paper, we study the vertex pursuit game of Cops and Robbers, in which cops try to capture a robber on the vertices of a graph. The minimum number of cops required to win on a given graph G is called the cop number of G. We focus on g (n, r, p), a percolated random geometric graph in which n vertices are chosen uniformly at random and independently from [0,1](2). Two vertices are adjacent with probability p if the Euclidean distance between them is at most r. If the distance is bigger then r then they are never adjacent. We present asymptotic results for the game of Cops and Robbers played on g(n, r, p) for a wide range of p = p(n) and r = r (n). |
Year | Venue | Keywords |
|---|---|---|
2015 | CONTRIBUTIONS TO DISCRETE MATHEMATICS | cops and robbers,random graphs |
Field | DocType | Volume |
Discrete mathematics,Graph,Combinatorics,Random graph,Vertex (geometry),Euclidean distance,Random geometric graph,Mathematics | Journal | 10 |
Issue | ISSN | Citations |
1 | 1715-0868 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anshui Li | 1 | 0 | 0.34 |
| Tobias Müller | 2 | 214 | 15.95 |
| Pawel Pralat | 3 | 234 | 48.16 |