Enumeration of labeled, connected, homeomorphically irreducible graphs (Q1814542): Difference between revisions

From the text: The labeled, homeomorphically irreducible trees have been enumerated by \textit{A. Meir} and \textit{J. W. Moon} [Mathematika, Lond. 15, 188--192 (1968; Zbl 0167.17205)]. In this paper we obtain for such trees the analogue of Clarke's formula [\textit{J. W. Moon}, ``Enumerating labelled trees'', in: Graph theory and theoretical physics, 261--272 (1967; Zbl 0204.24502)]. As a consequence we obtain the asymptotic behavior of the probability that a fixed vertex has a given degree in a random, labeled, homeomorphically irreducible tree. Then with the aid of the inclusion- exclusion method, occurring in a rudimentary form already in the above- mentioned paper of J. W. Moon and applied systematically by \textit{G. N. Bagaev} [``Limit distributions of metric characteristics of an indecomposable random mapping'', in: Combinatorial and Asymptotic Analysis [in Russian], No. 2, Krasnoyarsk. Gos. Univ., Krasnoyarsk, 55--61 (1977)], we enumerate the labeled, connected, homeomorphically irreducible, sparse graphs. In view of the awkwardness of the obtained exact formulas, we find also the corresponding asymptotics.