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