Analysis of three graph parameters for random trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 19286 (Why is no real title available?)
- scientific article; zbMATH DE number 2232270 (Why is no real title available?)
- Normal convergence problem? Two moments and a recurrence may be the clues
- On convergence rates in the central limit theorems for combinatorial structures
- On the Altitude of Nodes in Random Trees
- On the asymptotic behavior of the independence number of a random (n,n)-tree
- Path node-covering constants for certain families of trees
- Singularity Analysis of Generating Functions
- The average height of binary trees and other simple trees
Cited in
(7)- On the independence number of some random trees
- A distributional study of the path edge-covering numbers for random trees
- The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees
- scientific article; zbMATH DE number 7234299 (Why is no real title available?)
- scientific article; zbMATH DE number 398957 (Why is no real title available?)
- On the peel number and the leaf-height of Galton–Watson trees
- Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
This page was built for publication: Analysis of three graph parameters for random trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055764)