A simple graph (a graph without parallel edge or loops) with n vertices and k components can have at most
- A. n edges
- B. n - k edges
- C. (n - k)(n - k + 1)
- D. (n - k)(n - k + 1)/2 edges
Answer: D. (n - k)(n - k + 1)/2 edges
Explanation: Max edges occur when one component is a complete graph of n-k+1 vertices and rest are isolated.