Notes by Lex Toumbourou

A graph G is called an acyclic graph if and only if G has no cycles. It has no loops and no parallel edges.

• $G_1$ contains a cycle B, C, D, E
• $G_2$ contains no cycle (it is acyclic)