On the number of labeled outerplanar k-cycle blocks
-
Vitaliy A. Voblyi
Abstract
An explicit formula is obtained for the number of labeled outerplanar k-cycle blocks with a given number of vertices.
Originally published in Diskretnaya Matematika (2016) 28, №3, 26–27 (in Russian).
References
[1] Bodirsky M., Kang M., “Generating outerplanar graphs uniformly at random”, Combinatorics, Probability and Computing, 15 (2006), 333–343.10.1017/S0963548305007303Search in Google Scholar
[2] Flajolet Ph., Noy M., “Analytic combinatorics of non-crossing configurations”, Discrete Math., 204 (1999), 203–229.10.1016/S0012-365X(98)00372-0Search in Google Scholar
[3] Bodirsky M., Gimenez O., Kang M., Noy M., “Enumeration and limit laws of series-parallel graphs”, Europ. J. Combinatorics, 28 (2007), 2091–2105.10.1016/j.ejc.2007.04.011Search in Google Scholar
[4] Prudnikov A.P. et al., Integrals and series, 1, M.: Nauka, GRFML, 1981 (in Russian), 799 pp.Search in Google Scholar
[5] Lando S.K., Introduction to discrete mathematics, M.: MCCME, 2012 (in Russian), 265 pp.Search in Google Scholar
© 2017 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- Estimating the level of affinity of a quadratic form
- Cyclic decomposition of sets, set-splitting digraphs and cyclic classes of risk-free games
- Large deviations of branching processes with immigration in random environment
- On the probability of existence of substrings with the same structure in a random sequence
- Linearly realizable automata
- On the number of labeled outerplanar k-cycle blocks
- Convergence of the sequence of the Pearson statistics values to the normalized square of the Bessel process
Articles in the same Issue
- Frontmatter
- Estimating the level of affinity of a quadratic form
- Cyclic decomposition of sets, set-splitting digraphs and cyclic classes of risk-free games
- Large deviations of branching processes with immigration in random environment
- On the probability of existence of substrings with the same structure in a random sequence
- Linearly realizable automata
- On the number of labeled outerplanar k-cycle blocks
- Convergence of the sequence of the Pearson statistics values to the normalized square of the Bessel process
