The cop density of a graph

MaRDI QIDQ3558603zbMATH OpenFDO

Authors Anthony Bonato, Geňa Hahn, Changping Wang

Publication date 5 May 2010

zbMATH Keywords

cop densitycop numbercops and robber gameinfinite graphrandom graph

Mathematics Subject Classification ID

Infinite graphs (05C63) Structural characterization of families of graphs (05C75) Random graphs (graph-theoretic aspects) (05C80) Games with infinitely many players (91A07) Games involving graphs (91A43)

Recommendations

• Cops and robbers in a random graph
• The capture time of a graph
• When does a random graph have constant cop number?
• Cops and Robber game with a fast robber on expander graphs and random graphs
• Cops and robbers on geometric graphs

Cited in

(15)

• The capture time of a graph
• Limited visibility cops and robber
• Hyperopic cops and robbers
• Security and formation of network-centric operations
• Large classes of infinite k-cop-win graphs
• Independence densities of hypergraphs
• Almost all cop-win graphs contain a universal vertex
• Fighting constrained fires in graphs
• The damage number of a graph
• Vertex Pursuit Games in Stochastic Network Models
• Cops and robbers from a distance
• Time-delayed cops and robbers
• m-eternal domination and variants on some classes of finite and infinite graphs
• Catching a robber on a random k-uniform hypergraph
• Cop number of random k-uniform hypergraphs (extended abstract)

This page was built for publication: The cop density of a graph

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