Singleton Graph is Edgeless

Theorem
The singleton graph $N_1$ is edgeless.

Proof
Recall the definition of $N_1$:

As $N_1$ is simple, the only edges are between distinct vertices.

As $N_1$ has only one vertex, $N_1$ can have no edges.