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

The article is devoted to the study of the change in the optimal number of pursuers when removing one edge in a differential game on graphs. It is shown that when one edge of the icosahedron is removed, two pursuers are sufficient to capture the evader, whereas for the icosahedron itself, this number is 3.