MathNet 2018-part-07 — 177 problems (EN–VI) Question 1

Let $G$ be a simple graph with $k$ connected components, which have $a_{1}, \ldots, a_{k}$ vertices, respectively. Determine the number of ways to add $k-1$ edges to $G$ to form a connected graph, in terms of the numbers $a_{i}$.