Abstract
A tree is a connected graph that contains no cycle. Figure 4.1 contains three examples of trees. It is also clear that every path is a tree, and the star K1,n is a tree for every n.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Second Edition, Birkhäuser Boston
About this chapter
Cite this chapter
Wallis, W.D. (2007). Trees. In: A Beginner’s Guide to Graph Theory. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4580-9_4
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4580-9_4
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4484-0
Online ISBN: 978-0-8176-4580-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)