Math — Graph Theory
Handshaking lemma, trees and Euler's formula.
Rendering…
Make it your own.
\sum_{v} \deg(v) = 2|E|
\text{tree: } |E| = |V| - 1
V - E + F = 2
K_n \text{ has } \binom{n}{2} \text{ edges}
Handshaking lemma, trees and Euler's formula.
\sum_{v} \deg(v) = 2|E|
\text{tree: } |E| = |V| - 1
V - E + F = 2
K_n \text{ has } \binom{n}{2} \text{ edges}