Null Graph is Tree

Theorem

The null graph $N_0$ is a tree.

Proof

By definition, a tree is a connected graph with no cycles.

From Null Graph is Connected, $N_0$ is a connected graph.

The null graph has no edges.

Hence the null graph has no cycles vacuously.

Hence the result.

$\blacksquare$