Article
Licensed
Unlicensed
Requires Authentication
On enumeration of labelled connected graphs by the number of cutpoints
-
V. A. Voblyi
Published/Copyright:
May 9, 2008
Abstract
We study the numbers Smn of labelled connected graphs with n vertices among which m are cutpoints. We obtain an explicit expression for the exponential generating function Sm(Z) of these numbers and find the asymptotics of the numbers Smn as n→ ∞ and m = o(n).
Received: 2005-10-21
Published Online: 2008-05-09
Published in Print: 2008-March
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Random polynomials over a finite field
- Random permutations with cycle lengths in a given finite set
- The Kloss convergence principle for products of random variables with values in a compact group and distributions determined by a Markov chain
- On enumeration of labelled connected graphs by the number of cutpoints
- Skew Laurent series rings and the maximum condition on right annihilators
- A block algorithm of Lanczos type for solving sparse systems of linear equations
- On complexity of the anti-unification problem
- Classification of indecomposable Abelian (v, 5)-groups
Articles in the same Issue
- Random polynomials over a finite field
- Random permutations with cycle lengths in a given finite set
- The Kloss convergence principle for products of random variables with values in a compact group and distributions determined by a Markov chain
- On enumeration of labelled connected graphs by the number of cutpoints
- Skew Laurent series rings and the maximum condition on right annihilators
- A block algorithm of Lanczos type for solving sparse systems of linear equations
- On complexity of the anti-unification problem
- Classification of indecomposable Abelian (v, 5)-groups
