A simple undirected graph has 6 vertices and every vertex has degree 3. How many edges does the graph have?

Explanation

By the handshaking lemma the sum of the degrees (6 × 3 = 18) equals twice the number of edges, so there are 9 edges.