The damage number of a graph

MaRDI QIDQ5206905zbMATH OpenFDO

Authors Asiyeh Sanaei, D. Cox

Publication date 19 December 2019

Full work available at URL http://ajc.maths.uq.edu.au/pdf/75/ajc_v75_p001.pdf

zbMATH Keywords

damage density of a graph

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• The damage throttling number of a graph
• The capture time of a graph
• Cops and robbers in a random graph
• scientific article; zbMATH DE number 5241699
• Cops and robbers from a distance

Cites work

• Characterizations of k-copwin graphs
• Cop-win graphs with maximum capture-time
• How to Burn a Graph
• Seepage in directed acyclic graphs
• The Firefighter problem: a survey of results, directions and questions
• The capture time of a graph
• The cop density of a graph
• Vertex-to-vertex pursuit in a graph

Cited in

(3)

• The damage number of the Cartesian product of graphs
• Games on Graphs: Cop and Robber, Hungry Spiders, and Broadcast Domination
• The damage throttling number of a graph

This page was built for publication: The damage number of a graph

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