Combinatorics Trees, paths, cycles, connectivity Concept
Spanning tree
Summary
A spanning tree of a graph is a tree inside the graph that reaches every vertex. Spanning trees are the minimal connected spanning subgraphs, with uses in network design and in counting. The node spanning tree gives the precise definition.
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Spanning_tree, Definitions
About this page
| Tag | 0S4ZEZM7KE |
|---|---|
| URI | m2://0S4ZEZM7KE |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C05 |
| Specializes | Tree, Subgraph |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.