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, 2020, Volume 27, Issue 1, Pages 5–16
DOI: https://doi.org/10.33048/daio.2020.27.653 (Mi da941) 		 
This article is cited in 4 scientific papers (total in 4 papers)

On the number of labeled outerplanar $k$-cyclic bridgeless graphs

V. A. Voblyi

Russian Institute for Scientific and Technical Information RAS 20 Usievich Street, 125190 Moscow, Russia
Full-text PDF (293 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.33048/daio.2020.27.653
Abstract: We obtain an explicit formula for the number of labeled connected outerplanar $k$-cyclic $n$-vertex bridgeless graphs. We find asymptotics for the number of those graphs for a large number of vertices and fixed $k$. As a consequence, we prove that, for $k$ fixed, almost all labeled connected outerplanar $k$-cyclic graphs have bridges. Tab. 1, bibliogr. 14.
Keywords: enumeration, labeled graph, outerplanar graph, bridgeless graph, $k$-cyclic graph, asymptotics.
Received: 21.03.2019
Revised: 09.10.2019
Accepted: 27.11.2019
English version:
Journal of Applied and Industrial Mathematics, 2020, Volume 14, Issue 1, Pages 205–211
DOI: https://doi.org/10.1134/S1990478920010196
Bibliographic databases:
Document Type: Article
UDC: 519.175.3
Language: Russian
Citation: V. A. Voblyi, “On the number of labeled outerplanar $k$-cyclic bridgeless graphs”, Diskretn. Anal. Issled. Oper., 27:1 (2020), 5–16; J. Appl. Industr. Math., 14:1 (2020), 205–211
Citation in format AMSBIB
\Bibitem{Vob20}
\by V.~A.~Voblyi
\paper On the number of labeled outerplanar $k$-cyclic~bridgeless graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 2020
\vol 27
\issue 1
\pages 5--16
\mathnet{http://mi.mathnet.ru/da941}
\crossref{https://doi.org/10.33048/daio.2020.27.653}
\transl
\jour J. Appl. Industr. Math.
\yr 2020
\vol 14
\issue 1
\pages 205--211
\crossref{https://doi.org/10.1134/S1990478920010196}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85082393286}
Linking options:
  • https://www.mathnet.ru/eng/da941
  • https://www.mathnet.ru/eng/da/v27/i1/p5
    • 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:266
    Full-text PDF :57
    References:19
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024