Taylor Ball

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We show that the cop number of every generalized Petersen graph is at most 4. The strategy is to play a modified game of cops and robbers on an infinite cyclic covering space where the objective is to capture the robber or force the robber towards an end of the infinite graph. We prove that finite isometric subtrees are 1-guardable and apply this to(More)
  • 1