The handshaking theorem is a statement that, in every finite undirected graph, the total degree of all the vertices is exactly double the number of edges. Formally given a undirected graph :