Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 1996, Volume 8, Issue 2, Pages 108–116
DOI: https://doi.org/10.4213/dm521 (Mi dm521) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Search problems on graphs of regular polyhedra

N. N. Petrov
Full-text PDF (1184 kB) Citations (1)
DOI: https://doi.org/10.4213/dm521
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.
Received: 24.04.1991
Bibliographic databases:
UDC: 517.977
Language: Russian
Citation: N. N. Petrov, “Search problems on graphs of regular polyhedra”, Diskr. Mat., 8:2 (1996), 108–116; Discrete Math. Appl., 6:3 (1996), 233–240
Citation in format AMSBIB
\Bibitem{Pet96}
\by N.~N.~Petrov
\paper Search problems on graphs of regular polyhedra
\jour Diskr. Mat.
\yr 1996
\vol 8
\issue 2
\pages 108--116
\mathnet{http://mi.mathnet.ru/dm521}
\crossref{https://doi.org/10.4213/dm521}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1405513}
\zmath{https://zbmath.org/?q=an:0869.90095}
\transl
\jour Discrete Math. Appl.
\yr 1996
\vol 6
\issue 3
\pages 233--240
Linking options:
  • https://www.mathnet.ru/eng/dm521
  • https://doi.org/10.4213/dm521
  • https://www.mathnet.ru/eng/dm/v8/i2/p108
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025