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\).
![nullgraphs](https://github.com/bookofproofs/bookofproofs.github.io/blob/main/_sources/_assets/images/examples/nullgraphs.png?raw=true)
(c) bookofproofs
Thank you to the contributors under CC BY-SA 4.0!
![](https://github.com/bookofproofs/bookofproofs.github.io/blob/main/_sources/_assets/images/calendar-black.png?raw=true)
- Github:
-
![bookofproofs](https://github.com/bookofproofs.png?size=32)
References
Bibliography
- Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000