|
This article is cited in 3 scientific papers (total in 3 papers)
On an approach to enumeration of labeled connected graphs: A review
V. A. Voblyi All-Russian Institute for Scientific and Technical Information of Russian Academy of Sciences, Moscow
Abstract:
The classical functional Riddell equation connects the generating functions of labeled connected graphs and their blocks. Using the Lagrange inversion theorem, the author obtained from this equation a formula, which is a convenient tool for the exact and asymptotic enumeration of labeled graphs in the case where the generating function of their blocks is known. This formula is valid for block-stable graph classes. A review of enumerative results obtained by using this approach for cacti, block-cactus graphs, Eulerian graphs, geodesic graphs, planar graphs, and series-parallel graphs is presented.
Keywords:
enumeration, labeled graph, connected graph, block.
Citation:
V. A. Voblyi, “On an approach to enumeration of labeled connected graphs: A review”, Differential Equations and Mathematical Modeling, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 188, VINITI, Moscow, 2020, 106–118; J. Math. Sci. (N. Y.), 287:6 (2025), 920–933
Linking options:
https://www.mathnet.ru/eng/into744 https://www.mathnet.ru/eng/into/v188/p106
|
|