Affiliation:
1. Amirkabir University of Technology, Iran
2. University of Science and Technology, Iran
Abstract
In this chapter, the authors present a special and important type of graphs named Trees. Although the concept of a tree is simple, many applications of graph theory in science and engineering are related to this type. The topics of this chapter are selected based on theory and application of trees. Rooted trees, spanning trees, fundamental cycles and bounds, and tree search algorithms are covered. However, this chapter mainly focuses on spanning trees and tree search algorithms.
Reference18 articles.
1. Graph Theory
2. Local search with perturbations for the prize-collecting Steiner tree problem in graphs
3. On the theory of the analytical forms called trees.;A.Cayley;Philosophical Magazine,1857
4. A theorem on trees.;A.Cayley;The Quarterly Journal of Pure and Applied Mathematics,1889