Abstract
In this first chapter we survey several types of random trees. We start with basic notions on trees and the description of several concepts of tree counting problems. In particular we distinguish between rooted and unrooted, plane and non-plane, and labelled and unlabelled trees. It is also possible to modify the counting procedure by putting certain weights on trees, for example, by using the degree distribution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag/Wien
About this chapter
Cite this chapter
(2009). Classes of Random Trees. In: Random Trees. Springer, Vienna. https://doi.org/10.1007/978-3-211-75357-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-211-75357-6_1
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-75355-2
Online ISBN: 978-3-211-75357-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)