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 1, Pages 52–63
DOI: https://doi.org/10.4213/dm988 (Mi dm988) 		 
This article is cited in 4 scientific papers (total in 4 papers)

On enumeration of labelled connected graphs by the number of cutpoints

V. A. Voblyi
Full-text PDF (130 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm988
Abstract: We study the numbers $S_{mn}$ of labelled connected graphs with $n$ vertices among which $m$ are cutpoints. We obtain an explicit expression for the exponential generating function $S_m(z)$ of these numbers and find the asymptotics of the numbers $S_{mn}$ as $n\to\infty$ and $m=o(n)$.
Received: 21.10.2005
English version:
Discrete Mathematics and Applications, 2008, Volume 18, Issue 1, Pages 57–69
DOI: https://doi.org/10.1515/DMA.2008.004
Bibliographic databases:
UDC: 519.15
Language: Russian
Citation: V. A. Voblyi, “On enumeration of labelled connected graphs by the number of cutpoints”, Diskr. Mat., 20:1 (2008), 52–63; Discrete Math. Appl., 18:1 (2008), 57–69
Citation in format AMSBIB
\Bibitem{Vob08}
\by V.~A.~Voblyi
\paper On enumeration of labelled connected graphs by the number of cutpoints
\jour Diskr. Mat.
\yr 2008
\vol 20
\issue 1
\pages 52--63
\mathnet{http://mi.mathnet.ru/dm988}
\crossref{https://doi.org/10.4213/dm988}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2420496}
\zmath{https://zbmath.org/?q=an:1171.05345}
\elib{https://elibrary.ru/item.asp?id=20730228}
\transl
\jour Discrete Math. Appl.
\yr 2008
\vol 18
\issue 1
\pages 57--69
\crossref{https://doi.org/10.1515/DMA.2008.004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-64549103291}
Linking options:
  • https://www.mathnet.ru/eng/dm988
  • https://doi.org/10.4213/dm988
  • https://www.mathnet.ru/eng/dm/v20/i1/p52
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:519
    Full-text PDF :211
    References:49
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024