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.
KeywordsSpan Tree Connected Graph Minimal Span Tree Finite Graph Span Subgraph
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.
Unable to display preview. Download preview PDF.
© Springer Science+Business Media New York 2000