Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Cops and Robbers on diameter two graphs   In this short paper we study the game of Cops and Robbers, played on the
vertices of some fixed graph $G$ of order $n$. The minimum number of cops
required to capture a robber is called the cop number of $G$. We show that the
cop number of graphs of diameter 2 is at most $\sqrt{2n}$, improving a recent
result of Lu and Peng by a constant factor. We conjecture that this bound is
still not optimal, and obtain some partial results towards the optimal bound.

35
The categories of this paper are: mtrl-th
4
The categories of this paper are: cond-mat
29
The categories of this paper are: funct-an
27
The categories of this paper are: comp-gas
26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
18
The categories of this paper are: econ
22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg
12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
34
The categories of this paper are: chem-ph
10
The categories of this paper are: q-bio
3
The categories of this paper are: physics