Question

A simple graph with n vertices and k components can have atmost ............ no of edges ​

Answer 1

Answer:

$\sf \: A \: simple \: graph \: withn \: vertices \: and \\ \sf \: k \: components \: can \: have \: at \: most \\ \sf \: have \frac{(n-k)(n- k+1)}{2} \: edges.$