Definition Forest A simple undirected graph is called forest if it is acyclic. Counting vertices via connected components Let be a forest with connected components. Then the number of vertices is equal to the number of edges plus , i.e.,