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.

Three trees


Span Tree Connected Graph Minimal Span Tree Multiple Edge Finite Graph 
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.

Unable to display preview. Download preview PDF.

Copyright information

© Second Edition, Birkhäuser Boston 2007

Authors and Affiliations

  • W. D. Wallis
    • 1
  1. 1.Department of MathematicsSouthern Illinois UniversityCarbondaleUSA

Personalised recommendations