If G is a simple undirected graph with 12 vertices and 3 connected components, what is the largest number of edges it might have?
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.