Abstract
We have met trees when we were studying enumeration problems; now we take a look at them as graphs. A graph G = (V, E) is called a tree if it is connected and contains no cycle as a subgraph. The simplest tree has one node and no edges. The second simplest tree consists of two nodes connected by an edge. Figure 8.1 shows a variety of other trees.
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
© 2003 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Lovász, L., Pelikán, J., Vesztergombi, K. (2003). Trees. In: Discrete Mathematics. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/0-387-21777-0_8
Download citation
DOI: https://doi.org/10.1007/0-387-21777-0_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95585-8
Online ISBN: 978-0-387-21777-2
eBook Packages: Springer Book Archive