Finite graphs and trees
Graphs represent pairwise connections; trees impose acyclicity.
Key knowledge
A finite graph has vertices V and edges between them; directed edges are ordered pairs. A nonempty simple undirected tree is connected and has no cycles; every pair of vertices has a unique simple path.
Conditions and scope
- Simple graphs exclude loops and parallel edges in this entry.
- A directed acyclic graph need not be an undirected tree.
Sources · 2
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Graph definitions, adjacency representations, edge-count distances and BFS shortest paths. Connected acyclic undirected tree definition and unique-path property; typo saying n−1 nodes excluded.
2026-10-10 · Finite graph conventions and connected-acyclic tree criterion.
Entry details
Permanent link to this entry ↗- Record identity
- info-finite-graphs-trees
- Revision
- university-reference.1
- Structured reference record
- University reference