On the number of pursuers that guarantees the capture of the evader in the game on the graph of icosahedral edges

MaRDI QIDQ6646199zbMATH OpenFDO

Authors A. A. Azamov, Azamat G. Kholboev

Publication date 29 November 2024

Published in Matematicheskaya Teoriya Igr i eë Prilozheniya (Search for Journal in Brave)

zbMATH Keywords

evasion problemgeometric graphicosahedronpursuers strategypursuit problem

Mathematics Subject Classification ID

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

Recommendations

• The pursuit-evasion game on the 1-skeleton graph of the regular polyhedron. I
• The pursuit-evasion game on the 1-skeleton graph of a regular polyhedron. II
• Game with Slow Pursuers on the Edge Graphs of Regular Simplexes
• scientific article; zbMATH DE number 6706329
• The pursuit-evasion game on the 1-skeleton graph of the regular polyhedron. III

Cites work

• A game of cops and robbers
• scientific article; zbMATH DE number 6009880 (Why is no real title available?)
• scientific article; zbMATH DE number 41620 (Why is no real title available?)
• scientific article; zbMATH DE number 3289061 (Why is no real title available?)
• Note on a pursuit game played on graphs
• The game of cops and robbers on graphs
• The pursuit-evasion game on the 1-skeleton graph of a regular polyhedron. II
• The pursuit-evasion game on the 1-skeleton graph of the regular polyhedron. I
• Unsolved problems in combinatorial games

This page was built for publication: On the number of pursuers that guarantees the capture of the evader in the game on the graph of icosahedral edges

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