Recall that an acyclic graph is one that contains no cycles. A connected acyclic graph is called a tree. The trees on six vertices are shown in Figure 4.1. According to these definitions, each component of an acyclic graph is a tree. For this reason, acyclic graphs are usually called forests.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Rights and permissions
Copyright information
© 2008 J.A. Bondy & U.S.R. Murty
About this chapter
Cite this chapter
(2008). Trees. In: Graph Theory. Graduate Texts in Mathematics, vol 244. Springer, London. https://doi.org/10.1007/978-1-84628-970-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-84628-970-5_4
Publisher Name: Springer, London
Print ISBN: 978-1-84628-969-9
Online ISBN: 978-1-84628-970-5