List the degrees of the vertices of each of these graphs. Verify both parts of Theorem 3...

List the degrees of the vertices of each of these graphs. Verify both parts of Theorem 3.5.1 in each case.

Reference:

Theorem 3.5.1

(a) The Handshaking Lemma. For every graph G, the sum of the degrees of the vertices is twice the number of edges. Thus the sum of the degrees is even.

(b) For every graph G, the number of vertices of G having odd degree is even.