Null Graph is Complete Graph

Theorem

The null graph $N_0$ is the complete graph $K_0$.

Proof

By definition, the complete graph $K_0$ has no vertices.

Hence the result by definition of null graph.

$\blacksquare$