RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 2021 Volume 28, Issue 4, Pages 61–69 (Mi da1285)

This article is cited 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

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.

UDC: 519.175.3

Received: 10.05.2021
Revised: 08.08.2021
Accepted: 16.08.2021

DOI: 10.33048/daio.2021.28.715



© Steklov Math. Inst. of RAS, 2025