◀ ▲ ▶Branches / Graph-theory / Lemma: Size of an `\(r\)`-regular Graph with `\(n\)` Vertices
Lemma: Size of an \(r\)-regular Graph with \(n\) Vertices
Let \(G(V,E)\) be an \(r\)-regular graph with \(n\) vertices. Then the size of \(G\) is
\[|E|=\frac {nr}2.\]
Table of Contents
Proofs: 1
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