Handshake Lemma For finite Graph G=(V,E), we have that the sum of the degrees is equal to twice the number of edges. That is, v∈V∑deg(v)=2∣E∣ Proof: When we count the degrees of vertices of G, each edge of G is counted twice.