In a simple undirected graph, the sum of the degrees of all vertices is 20. How many edges are present in the graph?
Show Hint
For a "simple" graph with $E$ edges, the number of vertices $n$ must satisfy the inequality $E \leq \frac{n(n-1)}{2}$. For 10 edges, the graph must have at least 5 vertices.