◀ ▲ ▶Branches / Graph-theory / Definition: Finite and Infinite Graphs

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!

Github:

References

Bibliography

1. Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000