scientific article; zbMATH DE number 4106884
From MaRDI portal
Publication:3831035
Some quadratic recurrences occur in the problems of enumeration of connected sparsely graphs [see \textit{E. M. Wright}, J. Graph Theory 1, 317-330 (1977; Zbl 0337.05119); the author, Metody Diskretn. Anal. 42, 3- 16 (1985; Zbl 0658.05036)]. Asymptotics for these recurrences are obtained using the representations of corresponding generating functions with the help of Bessel functions. Misprint: In the formula (1.1) for the summation index there must be \(s=0\).
Recommendations
Cited in
(6)- Enumeration of labeled, connected, homeomorphically irreducible graphs
- Forbidden subgraphs in connected graphs
- On the asymptotic enumeration of labeled connected \(k\)-cyclic graphs without bridges
- Enumeration of labeled connected graphs with given order and size
- The probability of unusually large components in the near-critical Erdős-Rényi graph
- On one approach to enumeration of labeled connected graphs: a review
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3831035)