Spanning tree
Definition
Let be a graph. A spanning tree of is a subgraph of that contains every vertex of and is a tree.
Remarks
A graph has a spanning tree if and only if it is connected. The node every connected graph has a spanning tree gives one direction. A spanning tree of a finite connected graph with vertices has edges. The complete graph has spanning trees, by Cayley's formula. A minimum spanning tree has the least total weight.
Explanations
L1 human
A spanning tree keeps all the vertices of a graph and just enough edges to stay connected without any loop. For a road network, it is a smallest set of roads that still links all towns.
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 11 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Graph definition
- Subgraph definition
- Walk definition
- Reachability definition
- Trail definition
- Connected graph definition
- Circuit definition
- Cycle definition
- Acyclic graph definition
- Tree definition
- Spanning tree definition
What depends on this
2 nodes use this node, directly or through other nodes.
- Every connected graph has a spanning tree 04XPQT2XTC
- Minimum spanning tree 0Z367CGNRM
Sources
- Web https://en.wikipedia.org/wiki/Spanning_tree, Definitions
What links here
Used by
- Every connected graph has a spanning tree 04XPQT2XTC
- Minimum spanning tree 0Z367CGNRM