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, 1992, Volume 4, Issue 2, Pages 52–60 (Mi dm730)  
This article is cited in 1 scientific paper (total in 1 paper)

Minimal trees with a given vertex-search number

P. A. Golovach
Full-text PDF (814 kB) Citations (1)
Abstract: Minimal trees with given vertex-search number (an invariant of graphs which arises in case of consideration of a search problem on a graph) are considered. Families of all such trees for a given vertex-search number have been constructed, and the problem of enumeration of the minimal trees has been solved, as well.
Received: 02.10.1991
Bibliographic databases:
UDC: 519.977
Language: Russian
Citation: P. A. Golovach, “Minimal trees with a given vertex-search number”, Diskr. Mat., 4:2 (1992), 52–60
Citation in format AMSBIB
\Bibitem{Gol92}
\by P.~A.~Golovach
\paper Minimal trees with a~given vertex-search number
\jour Diskr. Mat.
\yr 1992
\vol 4
\issue 2
\pages 52--60
\mathnet{http://mi.mathnet.ru/dm730}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=1181527}
\zmath{https://zbmath.org/?q=an:0769.05030}
Linking options:
  • https://www.mathnet.ru/eng/dm730
  • https://www.mathnet.ru/eng/dm/v4/i2/p52
    • 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
    		Дискретная математика
    Statistics & downloads:
    Abstract page:407
    Full-text PDF :153
    References:2
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025