Definition:Acyclic Graph

From ProofWiki
Jump to navigation Jump to search

Definition

An acyclic graph is a graph or digraph with no cycles.

An acyclic connected undirected graph is a tree.

An acyclic disconnected undirected graph is a forest.