(i) | $\text{Cycles}(G)$ is a D2744: Set of cycle subgraphs for $G$ |

**acyclic graph**if and only if \begin{equation} \text{Cycles}(G) = \emptyset \end{equation}

Definition D2747

Acyclic graph

Formulation 0

Let $G$ be a D778: Graph such that

Then $G$ is an **acyclic graph** if and only if
\begin{equation}
\text{Cycles}(G)
= \emptyset
\end{equation}

(i) | $\text{Cycles}(G)$ is a D2744: Set of cycle subgraphs for $G$ |

Children

▶ | D2749: Tree graph |