Definition:Acyclic Graph
Jump to navigation
Jump to search
Definition
An acyclic graph is a graph or digraph with no cycles.
Also see
- Definition:Tree (Graph Theory): an acyclic connected undirected graph
- Definition:Forest: an acyclic disconnected undirected graph
Sources
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): acyclic
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): acyclic
- 2021: Richard Earl and James Nicholson: The Concise Oxford Dictionary of Mathematics (6th ed.) ... (previous) ... (next): acyclic