Null Graph is Complete Bipartite Graph

Theorem

The null graph $N_0$ is the complete bipartite graph $K_{0, 0}$.

Proof

By definition, the complete bipartite graph $K_{0, 0}$ has no vertices.

Hence the result by definition of null graph.

$\blacksquare$