Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2021, Volume 28, Issue 4, Pages 61–69
DOI: https://doi.org/10.33048/daio.2021.28.715 (Mi da1285) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs

V. A. Voblyi

All-Russian Institute for Scientific and Technical Information, 20 Usievich Street, 125190 Moscow, Russia
Full-text PDF (300 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.33048/daio.2021.28.715
Abstract: We deduce asymptotic formulas for the number of labeled connected series-parallel $k$-cyclic graphs with given order and fixed number $k$. We prove that almost all labeled series-parallel $k$-cyclic connected graphs without bridges for a fixed number of $k$ are blocks. Bibliogr. 17.
Keywords: enumeration, labeled graph, block, bridgeless graph, series-parallel graph, $k$-cyclic graph, asymptotics, random graph.
Received: 10.05.2021
Revised: 08.08.2021
Accepted: 16.08.2021
Document Type: Article
UDC: 519.175.3
Language: Russian
Citation: V. A. Voblyi, “Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs”, Diskretn. Anal. Issled. Oper., 28:4 (2021), 61–69
Citation in format AMSBIB
\Bibitem{Vob21}
\by V.~A.~Voblyi
\paper Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 2021
\vol 28
\issue 4
\pages 61--69
\mathnet{http://mi.mathnet.ru/da1285}
\crossref{https://doi.org/10.33048/daio.2021.28.715}
Linking options:
  • https://www.mathnet.ru/eng/da1285
  • https://www.mathnet.ru/eng/da/v28/i4/p61
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:185
    Full-text PDF :48
    References:21
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024