Definition: Size of a Graph
The size of an undirected graph \(G(V,E,\gamma)\) is the number of its edges, i.e. \(|E|\).
Table of Contents
- Lemma: Size of an \(r\)-regular Graph with \(n\) Vertices
Mentioned in:
Lemmas: 1
Proofs: 2
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