Prikladnaya 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



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






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


Prikladnaya Diskretnaya Matematika, 2010, supplement № 3, Pages 68–70 (Mi pdm182)  

Mathematical Foundations of Reliability of Computing and Control Systems

On minimal vertex 1-extensions of special form superslim trees

M. B. Abrosimov, D. D. Komarov

Saratov State University, Saratov
References:
Abstract: Tree is called superslim if all vertices except the root and leaves have degree 2. We consider the minimal vertex 1-extensions of superslim trees and provide a lower bound for the number of additional edges of minimal vertex 1-extensions of arbitrary superslim tree. We describe two families of superslim trees, for which lower bound is achieved.
Document Type: Article
UDC: 519.17
Language: Russian
Citation: M. B. Abrosimov, D. D. Komarov, “On minimal vertex 1-extensions of special form superslim trees”, Prikl. Diskr. Mat., 2010, supplement № 3, 68–70
Citation in format AMSBIB
\Bibitem{AbrKom10}
\by M.~B.~Abrosimov, D.~D.~Komarov
\paper On minimal vertex 1-extensions of special form superslim trees
\jour Prikl. Diskr. Mat.
\yr 2010
\pages 68--70
\issueinfo supplement № 3
\mathnet{http://mi.mathnet.ru/pdm182}
Linking options:
  • https://www.mathnet.ru/eng/pdm182
  • https://www.mathnet.ru/eng/pdm/y2010/i12/p68
  • 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, 2024