Tree
Definition
A tree is a graph that is connected and acyclic.
Remarks
Let be a finite graph with vertices. Then these conditions are equivalent: is a tree; is connected with edges; is acyclic with edges. A graph is a tree if and only if any two vertices are joined by exactly one path. The node unique paths in trees states this. The path graphs and the stars are trees.
Explanations
L1 human
A tree is a connected graph with no loops. A family tree and the folders on a computer are pictures of trees.
What this node needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 9 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Graph definition
- Walk definition
- Reachability definition
- Trail definition
- Connected graph definition
- Circuit definition
- Cycle definition
- Acyclic graph definition
- Tree definition
What depends on this
11 nodes use this node, directly or through other nodes.
- Every connected graph has a spanning tree 04XPQT2XTC
- Unique paths in trees 096B7Q5742
- Forest 09JP6G9FTA
- Prüfer sequence 09PV9JSY6E
- Trees are bipartite 0BN2A6EBYA
- Rooted tree 0C9J6W2A8A
- Spanning tree 0FQ5B8S1ZC
- Every finite tree with at least two vertices has a leaf 0H8Q4MANBD
- Cayley's formula 0M2SSGSYPE
- A tree on n vertices has n − 1 edges 0VSNHTHK8T
- Minimum spanning tree 0Z367CGNRM
Sources
What links here
Used by
- Unique paths in trees 096B7Q5742
- Forest 09JP6G9FTA
- Prüfer sequence 09PV9JSY6E
- Trees are bipartite 0BN2A6EBYA
- Rooted tree 0C9J6W2A8A
- Spanning tree 0FQ5B8S1ZC
- Every finite tree with at least two vertices has a leaf 0H8Q4MANBD
- Cayley's formula 0M2SSGSYPE
- A tree on n vertices has n − 1 edges 0VSNHTHK8T