Singleton Graph is Complete

Theorem
The singleton graph $N_1$ is complete.

Proof
Recall the definition of $N_1$:

Recall the definition of complete graph:

As $N_1$ has only one vertex, this follows vacuously.