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

Loading [MathJax]/jax/output/CommonHTML/jax.js

Diskretnyi Analiz i Issledovanie Operatsii

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	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 5 scientific papers (total in 5 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 (5)

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 5 articles:

V. A. Voblyi, “On One Approach to Enumeration of Labeled Connected Graphs: A Review”, J Math Sci, 2025
V. A. Voblyi, “O perechislenii pomechennykh svyaznykh grafov bez mostov”, Materialy Mezhdunarodnoi konferentsii «Klassicheskaya i sovremennaya geometriya», posvyaschennoi 100-letiyu so dnya rozhdeniya professora Levona Sergeevicha Atanasyana (15 iyulya 1921 g.—5 iyulya 1998 g.). Moskva, 1–4 noyabrya 2021 g. Chast 4, Itogi nauki i tekhn. Sovrem. mat. i ee pril. Temat. obz., 223, VINITI RAN, M., 2023, 138–147
V. A. Voblyi, “Asimptoticheskoe perechislenie pomechennykh posledovatelno-parallelnykh $k$ -tsiklicheskikh grafov bez mostov”, Diskretn. analiz i issled. oper., 28:4 (2021), 61–69
V. A. Voblyi, “Asymptotic Enumeration of Labeled Series-Parallel $k$ -Cyclic Bridgeless Graphs”, J. Appl. Ind. Math., 15:4 (2021), 711
V. A. Voblyi, “Ob odnom podkhode k perechisleniyu pomechennykh svyaznykh grafov: obzor rezultatov”, Differentsialnye uravneniya i matematicheskoe modelirovanie, Itogi nauki i tekhn. Sovrem. mat. i ee pril. Temat. obz., 188, VINITI RAN, M., 2020, 106–118

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

Дискретный анализ и исследование операций

Statistics & downloads:
Abstract page:	336
Full-text PDF :	91
References:	49
First page:	7

Что такое QR-код?

Registration to the website

Logotypes