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

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


Diskr. Mat., 2008, Volume 20, Issue 1, Pages 52–63 (Mi dm988)  

This article is cited in 3 scientific papers (total in 3 papers)

On enumeration of labelled connected graphs by the number of cutpoints

V. A. Voblyi


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)$.

DOI: https://doi.org/10.4213/dm988

Full text: PDF file (130 kB)
References: PDF file   HTML file

English version:
Discrete Mathematics and Applications, 2008, 18:1, 57–69

Bibliographic databases:

UDC: 519.15
Received: 21.10.2005

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://www.ams.org/mathscinet-getitem?mr=2420496}
\zmath{https://zbmath.org/?q=an:1171.05345}
\elib{http://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{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-64549103291}


Linking options:
  • http://mi.mathnet.ru/eng/dm988
  • https://doi.org/10.4213/dm988
  • http://mi.mathnet.ru/eng/dm/v20/i1/p52

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. V. A. Voblyi, “Ob odnoi formule dlya chisla pomechennykh svyaznykh grafov”, Diskretn. analiz i issled. oper., 19:4 (2012), 48–59  mathnet  mathscinet
    2. V. A. Voblyi, “Enumeration of labeled connected graphs with given order and number of edges”, J. Appl. Industr. Math., 10:2 (2016), 302–310  mathnet  crossref  crossref  mathscinet  elib
    3. V. A. Voblyi, “The second Riddel relation and its consequences”, J. Appl. Industr. Math., 13:1 (2019), 168–174  mathnet  crossref  crossref
  • Дискретная математика
    Number of views:
    This page:348
    Full text:108
    References:25
    First page:5

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020