Email this article Enumeration of labeled connected graphs with given order and size
- Authors: Voblyi V.A.1
-
Affiliations:
- Bauman Moscow State Technical University
- Issue: Vol 10, No 2 (2016)
- Pages: 302-310
- Section: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212383
- DOI: https://doi.org/10.1134/S1990478916020149
- ID: 212383
Cite item
Open Access
Access granted
Subscription Access
Abstract
We deduce a new formula for the number of labeled connected graphs with given order and number of edges in terms of the block generating function. Applying this formula, we exactly and asymptotically enumerate cacti with given order and cyclomatic number.
Keywords
About the authors
V. A. Voblyi
Bauman Moscow State Technical University
Author for correspondence.
Email: vitvobl@yandex.ru
Russian Federation, Vtoraya Baumanskaya ul. 5, Moscow, 105005
Supplementary files
