The edgeless graph of order $n$ is denoted $N_n$.
Also known as
This is sometimes called an empty graph
Thus the term $n$-empty graph can often be seen for $N_n$.
The term null graph can also be found, but this can be confused with the graph with no vertices.
- The edgeless graph $N_n$ is $0$-regular for all $n$.
- The edgeless graph $N_n$ has $n$ components for all $n$.