Definition: Null Graph
A simple undirected graph \(G(V,E)\) with \(|V|=n\) vertices is called a null graph, if it has no edges.
The null graph with \(n\) vertices is denoted by \(N_n\).
(c) bookofproofs
Thank you to the contributors under CC BY-SA 4.0! 
- Github:
-
References
Bibliography
- Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000
