The question is Calculate the maximum number of edges in a simple graph with nnodes and k components.
I dont really understand what the question means .. and how to solve this..
You need to check your text material. Some authors allow degenerate components, one vertex, most do not.
Here is an example: Consider a twelve vertex graph with three components having three, four and five vertices.
Then the graph could be .
That is a maximum of edges in all.
That said, I don't know how to solve the general case.