Cops and Robbers on Graphs Based on Designs

DOI10.1002/jcd.21331zbMath1276.05020OpenAlexW1821740204MaRDI QIDQ2864796

Anthony Bonato, Andrea C. Burgess

Publication date: 26 November 2013

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21331

zbMATH Keywords

incidence graphsprojective planespartial geometriescops and robberscop numbergroup divisible designspolarity graphs\(G\)-designsblock intersection graphspoint graphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Games involving graphs (91A43) Other designs, configurations (05B30) Games on graphs (graph-theoretic aspects) (05C57) Graph designs and isomorphic decomposition (05C51)

Related Items (11)

Unnamed Item ⋮ A probabilistic version of the game of zombies and survivors on graphs ⋮ Cops that surround a robber ⋮ The localization number of designs ⋮ Unnamed Item ⋮ Cops and Robbers on diameter two graphs ⋮ Comparing the power of cops to zombies in pursuit-evasion games ⋮ Cops and robbers on directed and undirected abelian Cayley graphs ⋮ Independent Sets in Polarity Graphs ⋮ Conjectures on Cops and Robbers ⋮ Meyniel extremal families of abelian Cayley graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• Eigenvalue bounds for independent sets
• Truncated transversal designs: A new lower bound on the number of idempotent MOLS of side \(n\)
• Vertex-to-vertex pursuit in a graph
• Pancyclic BIBD block-intersection graphs
• On the number of edges of quadrilateral-free graphs
• On Meyniel's conjecture of the cop number
• On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
• A survey on the existence ofG-Designs
• On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
• Some maximal arcs in finite projective planes
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: Cops and Robbers on Graphs Based on Designs