Forest

Definition

Forest

A simple undirected graph $G$ is called forest if it is acyclic.

Counting vertices via connected components

Let $F$ be a forest with $k$ connected components. Then the number of vertices is equal to the number of edges plus $k$, i.e.,

$$|V(F)|=|E(F)|+k.$$