Geodesic
A formula for the number of labeled connected graphs
Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 4, pp. 48-59

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

We propose a new formula for the number of labeled connected graphs in terms of the generating function of their blocks. We apply this formula to cacti and outer-planar graphs. Bibliogr. 13.
Keywords: enumeration, connected graph, block, outer-planar graph.
Mots-clés : cactus 
@article{DA_2012_19_4_a3,
     author = {V. A. Voblyi},
     title = {A formula for the number of labeled connected graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {48--59},
     publisher = {mathdoc},
     volume = {19},
     number = {4},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2012_19_4_a3/}
}
TY  - JOUR
AU  - V. A. Voblyi
TI  - A formula for the number of labeled connected graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2012
SP  - 48
EP  - 59
VL  - 19
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2012_19_4_a3/
LA  - ru
ID  - DA_2012_19_4_a3
ER  - 
%0 Journal Article
%A V. A. Voblyi
%T A formula for the number of labeled connected graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2012
%P 48-59
%V 19
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2012_19_4_a3/
%G ru
%F DA_2012_19_4_a3
V. A. Voblyi. A formula for the number of labeled connected graphs. Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 4, pp. 48-59. http://geodesic.mathdoc.fr/item/DA_2012_19_4_a3/