This article is cited in 1 paper

Search problems on graphs of regular polyhedra

N. N. Petrov


Abstract: We consider the $n$-search number of a graph which is defined as the minimal number of pursuers needed to catch a moving object on a connected graph provided that there are no constraints on their velocity; $n$ characterizes the required closeness of the pursuers to the evader. We give the $n$-search numbers for the graphs of all regular polyhedra.

UDC: 517.977

Received: 24.04.1991

DOI: 10.4213/dm521

 English version: Discrete Mathematics and Applications, 1996, 6:3, 233–240

Bibliographic databases:

• 
•