|
This article is cited in 1 scientific paper (total in 1 paper)
On enumeration of labeled connected bridgeless graphs
V. A. Voblyi All-Russian Institute for Scientific and Technical Information of Russian Academy of Sciences, Moscow
Abstract:
In this paper, we obtain explicit formulas and asymptotics for some classes of bridgeless labeled graphs: cacti, block graphs, block-cactus graphs, and series-parallel graphs. We prove that, under a uniform probability distribution, almost all graphs from the classes considered have bridges.
Keywords:
enumeration, labeled graph, $k$-cyclic graph, block, bridge, bridgeless graph, Eulerian graph, series-parallel graph, asymptotics, random graph.
Citation:
V. A. Voblyi, “On enumeration of labeled connected bridgeless graphs”, Proceedings of the International Conference «Classical and Modern Geometry» dedicated to the 100th anniversary of the birth of Professor Levon Sergeyevich Atanasyan (July 15, 1921—July 5, 1998). Moscow, November 1–4, 2021. Part 4, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 223, VINITI, Moscow, 2023, 138–147
Linking options:
https://www.mathnet.ru/eng/into1163 https://www.mathnet.ru/eng/into/v223/p138
|
Statistics & downloads: |
Abstract page: | 77 | Full-text PDF : | 38 | References: | 13 |
|