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


Diskretn. Anal. Issled. Oper., 2020, Volume 27, Issue 1, Pages 5–16 (Mi da941)  

This article is cited in 1 scientific paper (total in 1 paper)

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

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.

DOI: https://doi.org/10.33048/daio.2020.27.653

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

English version:
Journal of Applied and Industrial Mathematics, 2020, 14:1, 205–211

UDC: 519.175.3
Received: 21.03.2019
Revised: 09.10.2019
Accepted:27.11.2019

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:
  • http://mi.mathnet.ru/eng/da941
  • http://mi.mathnet.ru/eng/da/v27/i1/p5

    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 odnom podkhode k perechisleniyu pomechennykh svyaznykh grafov: obzor rezultatov”, Differentsialnye uravneniya i matematicheskoe modelirovanie, Itogi nauki i tekhn. Ser. Sovrem. mat. i ee pril. Temat. obz., 188, VINITI RAN, M., 2020, 106–118  mathnet  crossref
  • Дискретный анализ и исследование операций
    Number of views:
    This page:133
    Full text:10
    References:7
    First page:7

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021