The edgeless graph of order $n$ is denoted $N_n$ and can be referred to as the $n$-edgeless graph.
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.
- Results about edgeless graphs can be found here.
- 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): Chapter $1$: Mathematical Models: $\S 1.3$: Graphs