On the Number of Pursuers That Guarantees the Capture of the Evader in a Game on the Graph of Icosahedral Edges
We study how the optimal number of pursuers in a differential game on a graph changes when an edge is removed from the graph. It is shown that, when one edge of an icosahedron is removed, two pursuers are sufficient to capture the evader, whereas, for the icosahedron itself, this number is 3.
Authors
- Абдулла Азамов (ORCID: https://orcid.org/0000-0003-3516-0904)
- A. G. Holboyev
Institutions
- Academy of Sciences Republic of Uzbekistan (UZ)
- National Pedagogical University of Uzbekistan named after Nizami (UZ)
Publication Details
- Journal
- Doklady Mathematics
- Published
- 2024-12-01
- DOI
- https://doi.org/10.1134/s1064562424602671
- Primary Topic
- Optimization and Search Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00