Cops and robbers on graphs based on designs

DOI10.1002/JCD.21331zbMATH Open1276.05020OpenAlexW1821740204MaRDI QIDQ2864796FDOQ2864796

Authors: Anthony Bonato, Andrea 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

Recommendations

• scientific article; zbMATH DE number 5241699
• Cops and robbers playing on edges
• A game of cops and robbers
• Cops and robbers in a random graph

zbMATH Keywords

projective planescop numbercops and robbersgroup divisible designspolarity graphspartial geometriesincidence graphs\(G\)-designsblock intersection graphspoint graphs

Mathematics Subject Classification ID

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

Cites Work

• Eigenvalue bounds for independent sets
• Vertex-to-vertex pursuit in a graph
• On Meyniel's conjecture of the cop number
• The game of cops and robbers on graphs
• A game of cops and robbers
• On Graphs that do not Contain a Thomsen Graph
• A survey on the existence ofG-Designs
• When does a random graph have constant cop number?
• Pancyclic BIBD block-intersection graphs
• On the number of edges of quadrilateral-free graphs
• 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 the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
• Truncated transversal designs: A new lower bound on the number of idempotent MOLS of side \(n\)

Cited In (17)

• Title not available (Why is that?)
• The combinatorial game \textsc{Nofil} played on Steiner triple systems
• Cops and Robbers on Planar‐Directed Graphs
• Meyniel extremal families of abelian Cayley graphs
• Comparing the power of cops to zombies in pursuit-evasion games
• Cops and Robbers on Graphs of Bounded Diameter
• The localization number of designs
• Cops and robbers on directed and undirected abelian Cayley graphs
• Independent sets in polarity graphs
• A probabilistic version of the game of zombies and survivors on graphs
• Title not available (Why is that?)
• Cops and Robbers on diameter two graphs
• Conjectures on cops and robbers
• Cops and Robbers on String Graphs
• Cops that surround a robber
• Title not available (Why is that?)
• The impact of loops on the game of cops and robbers on graphs

This page was built for publication: Cops and robbers on graphs based on designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864796)