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, 2008, Volume 20, Issue 3, Pages 47–50
DOI: https://doi.org/10.4213/dm1012 (Mi dm1012) 		 
A simple upper bound for the number of spanning trees of regular graphs

V. A. Voblyi
Full-text PDF (80 kB)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1012
Abstract: We obtain an upper bound for the number of spanning trees of regular graphs of degree $k$ which is in a sense asymptotically exact as $k\to\infty$.
Received: 10.06.2008
English version:
Discrete Mathematics and Applications, 2008, Volume 18, Issue 4, Pages 363–366
DOI: https://doi.org/10.1515/DMA.2008.026
Bibliographic databases:
UDC: 519.2
Language: Russian
Citation: V. A. Voblyi, “A simple upper bound for the number of spanning trees of regular graphs”, Diskr. Mat., 20:3 (2008), 47–50; Discrete Math. Appl., 18:4 (2008), 363–366
Citation in format AMSBIB
\Bibitem{Vob08}
\by V.~A.~Voblyi
\paper A simple upper bound for the number of spanning trees of regular graphs
\jour Diskr. Mat.
\yr 2008
\vol 20
\issue 3
\pages 47--50
\mathnet{http://mi.mathnet.ru/dm1012}
\crossref{https://doi.org/10.4213/dm1012}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2467453}
\zmath{https://zbmath.org/?q=an:1171.05347}
\elib{https://elibrary.ru/item.asp?id=20730252}
\transl
\jour Discrete Math. Appl.
\yr 2008
\vol 18
\issue 4
\pages 363--366
\crossref{https://doi.org/10.1515/DMA.2008.026}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-53349142281}
Linking options:
  • https://www.mathnet.ru/eng/dm1012
  • https://doi.org/10.4213/dm1012
  • https://www.mathnet.ru/eng/dm/v20/i3/p47
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:424
    Full-text PDF :195
    References:53
    First page:19
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024