◀ ▲ ▶Branches / Graph-theory / Definition: Size of a Graph

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

1. 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!

Github:

References

Bibliography

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