Combinatorics Trees, paths, cycles, connectivity Concept
Tree
Summary
A tree is a connected graph with no cycles. Trees are the minimal connected graphs, and they appear in data structures, in spanning problems and in counting problems. The node tree gives the precise definition.
Where this leads
6 pages build on this one.
Further reading
About this page
| Tag | 062D9KXJB1 |
|---|---|
| URI | m2://062D9KXJB1 |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C05 |
| Specializes | Forest, Connected graph |
| 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.
What links here
Definitions
Special cases
Used by
- Graph of groups
- Building
- Liouville property of graphs
- Hierarchical matrix
- Median algebra as a ternary algebra
- Graceful tree conjecture