|
Diskretnyi Analiz i Issledovanie Operatsii, 2023, Volume 30, Issue 4, Pages 24–34 DOI: https://doi.org/10.33048/daio.2023.30.778
(Mi da1332)
|
|
|
|
Enumeration of labeled bi-block graphs
V. A. Voblyi All-Russian Institute for Scientific and Technical Information RAS 20 Usievich Street, 125190 Moscow, Russia
DOI:
https://doi.org/10.33048/daio.2023.30.778
Abstract:
A bi-block graph is a connected graph in which all blocks are complete bipartite graphs. Labeled bi-block graphs and bridgeless bi-block graphs are enumerated exactly and asymptotically by the number of vertices. It is proved that almost all labeled connected bi-block graphs have no bridges. In addition, planar bi-block graphs are enumerated, and an asymptotic estimate is found for the number of such graphs. Tab. 1, bibliogr. 12.
Keywords:
enumeration, labeled graph, bridgeless graph, complete bipartite graph, planar graph, block, bi-block graph, random graph, asymptotics.
Received: 12.07.2023 Revised: 04.08.2023 Accepted: 20.08.2023
Citation:
V. A. Voblyi, “Enumeration of labeled bi-block graphs”, Diskretn. Anal. Issled. Oper., 30:4 (2023), 24–34; J. Appl. Industr. Math., 17:4 (2023), 901–907
Linking options:
https://www.mathnet.ru/eng/da1332 https://www.mathnet.ru/eng/da/v30/i4/p24
|
|