Maximum number of edges in a simple graph with ‘n’ vertices and ‘k’ components…
2017
Maximum number of edges in a simple graph with ‘n’ vertices and ‘k’ components is:
Attempted by 63 students.
Show answer & explanation
The correct option is B.
To maximize edges in a simple graph with n vertices and k components, one component should contain n - k + 1 vertices (formed as a complete graph) and the remaining k - 1 components should be isolated single vertices. The maximum edges formula is:
{(n-k)(n-k+1)} / 2