Forest

graph-theory

Definition

Forest

A simple undirected graph $W$ without loops is called forest.

Example: The followiing is a forest with three trees

For a forest $F$ with $k$ connected components, it holds that:

$${\alpha }_0(F)={\alpha }_1(F)+k$$