Abstract
“Trees” form an important class of graphs. Of late, their importance has grown considerably in view of their wide applicability in theoretical computer science. In this chapter, we present the basic structural properties of trees, their centers and centroids. In addition, we present two interesting consequences of the Tutte-Nashwilliams theorem on the existence of k pairwise edge-disjoint spanning trees in a simple connected graph. We also present Cay ley’s formula for the number of spanning trees in the labeled complete graph K n .
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Balakrishnan, R., Ranganathan, K. (2000). Trees. In: A Textbook of Graph Theory. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8505-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8505-7_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6422-4
Online ISBN: 978-1-4419-8505-7
eBook Packages: Springer Book Archive