Cop number of partial cubes

Abstract: The game of Cops and Robbers on graphs is a well-studied pursuit--evasion model whose central parameter, the cop number, captures the minimum number of pursuers required to guarantee capture of an adversary on a given graph. While the cop number has been determined for many classical graph families, relatively little is known about the important class of partial cubes, i.e., isometric subgraphs of hypercubes. In this paper, we establish a lower bound for the cop number of partial cubes and present an upper bound on a subclass of partial cubes. Additionally, we improve these bounds for a particular family of partial cubes: Fibonacci cubes. These graphs are defined as induced subgraphs of hypercubes obtained by forbidding consecutive ones in binary strings. Beyond their natural combinatorial interest, Fibonacci cubes have connections to chemical graph theory, where they serve as models for resonance graphs of certain classes of polycyclic aromatic hydrocarbons.