Null Graph is Connected

Theorem

The null graph $N_0$ is a connected graph.

Proof

By definition, a graph $G$ is connected if and only if every pair of vertices in $G$ is connected.

There are no vertices in $N_0$.

Hence the result holds vacuously.

$\blacksquare$