Abstract
A forest is an acyclic graph (that is, a graph with no cycles). The connected components of a forest are called trees. Therefore, a tree is a connected acyclic graph. In particular, any tree is a bipartite graph. A leaf is a vertex of degree one. In the figure below, we have a tree with seven leaves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2009 Hindustan Book Agency
About this chapter
Cite this chapter
Cioabă, S.M., Murty, M.R. (2009). Trees. In: A First Course in Graph Theory and Combinatorics. Texts and Readings in Mathematics, vol 55. Hindustan Book Agency, Gurgaon. https://doi.org/10.1007/978-93-86279-39-2_5
Download citation
DOI: https://doi.org/10.1007/978-93-86279-39-2_5
Publisher Name: Hindustan Book Agency, Gurgaon
Print ISBN: 978-81-85931-98-2
Online ISBN: 978-93-86279-39-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)