On the Number of Pursuers That Guarantees the Capture of the Evader in a Game on the Graph of Icosahedral Edges

IF 0.5 4区数学 Q3 MATHEMATICS

Doklady Mathematics Pub Date : 2025-03-28 DOI:10.1134/S1064562424602671

A. A. Azamov, A. G. Holboyev

引用次数: 0

Abstract

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.

查看原文本刊更多论文

二十面体边图上博弈中保证追捕者捕获的追捕者数量

我们研究了当一条边从图中移除时，图上微分对策中最优追求者的数量是如何变化的。结果表明，当去除二十面体的一条边时，两个追赶者足以捕获逃避者，而对于二十面体本身，这个数字为3。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Doklady Mathematics 数学-数学

CiteScore

1.00

自引率

16.70%

发文量

审稿时长

3-6 weeks

期刊介绍： Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.