Definition: Finite and Infinite Graphs
An undirected graph \(G(V,E,\gamma)\) is called finite (or infinite), if its order \(|G|\) is finite (or infinite) .
Mentioned in:
Corollaries: 1
Definitions: 2 3
Proofs: 4 5
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