Geodesic
Enumeration of labeled bi-block graphs
Diskretnyj analiz i issledovanie operacij, Tome 30 (2023) no. 4, pp. 24-34

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DA_2023_30_4_a1,
     author = {V. A. Voblyi},
     title = {Enumeration of labeled bi-block graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {24--34},
     publisher = {mathdoc},
     volume = {30},
     number = {4},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2023_30_4_a1/}
}
TY  - JOUR
AU  - V. A. Voblyi
TI  - Enumeration of labeled bi-block graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2023
SP  - 24
EP  - 34
VL  - 30
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2023_30_4_a1/
LA  - ru
ID  - DA_2023_30_4_a1
ER  - 
%0 Journal Article
%A V. A. Voblyi
%T Enumeration of labeled bi-block graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2023
%P 24-34
%V 30
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2023_30_4_a1/
%G ru
%F DA_2023_30_4_a1
V. A. Voblyi. Enumeration of labeled bi-block graphs. Diskretnyj analiz i issledovanie operacij, Tome 30 (2023) no. 4, pp. 24-34. http://geodesic.mathdoc.fr/item/DA_2023_30_4_a1/