Analysis of three graph parameters for random trees

DOI10.1002/rsa.20259zbMath1208.05011OpenAlexW4251430575MaRDI QIDQ3055764

Alois Panholzer, Cyril Banderier, Markus Kuba

Publication date: 9 November 2010

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20259

zbMATH Keywords

random treeskernel-sizenode-independence numberpath node-covering number

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (2)

On the peel number and the leaf-height of Galton–Watson trees ⋮ On the independence number of some random trees

Cites Work

• Unnamed Item
• Unnamed Item
• The average height of binary trees and other simple trees
• On convergence rates in the central limit theorems for combinatorial structures
• Normal convergence problem? Two moments and a recurrence may be the clues
• On the asymptotic behavior of the independence number of a random \((n,n)\)-tree
• Singularity Analysis of Generating Functions
• On the Altitude of Nodes in Random Trees
• Path node-covering constants for certain families of trees

This page was built for publication: Analysis of three graph parameters for random trees