Handshake Lemma
For finite Graph , we have that the sum of the degrees is equal to twice the number of edges. That is,
Proof: When we count the degrees of vertices of , each edge of is counted twice.
For finite Graph , we have that the sum of the degrees is equal to twice the number of edges. That is,
Proof: When we count the degrees of vertices of , each edge of is counted twice.