Cops and robbers on directed and undirected abelian Cayley graphs

Abstract

We show that the cop number of directed and undirected Cayley graphs on abelian groups has an upper bound of the form of $O(\sqrt{n})$, where $n$ is the number of vertices, by introducing a refined inductive method. With our method, we improve the previous upper bound on cop number for undirected Cayley graphs on abelian groups, and we establish an upper bound on the cop number of directed Cayley graphs on abelian groups. We also use Cayley graphs on abelian groups to construct new \emph{Meyniel extremal families}, which contain graphs of every order $n$ with cop number $\Theta (\sqrt{n})$.

18 pages, 2 figures

References in corpus (1)

• Meyniel Extremal Families of Abelian Cayley Graphs