471 views

2 Answers

0 votes
0 votes
120 is the correct answer.
4 vertices are used in 4 components and the remaining 20 - 4 = 16 vertices will be in the last component. Now what is the maximum number of edges for 16 vertices? (16*15)/2 = 120. Hence 120 is the answer.
0 votes
0 votes

Let edges is "e" and components(k) =5 vertices =20
e>= (n-k+1)*(n-k)/2
(20-5+1)*(20-5)/2              [20-5+1 = 16 not 14]
16*15/2= 120

edited by

Related questions

0 votes
0 votes
1 answer
2
Dknights asked Dec 12, 2023
422 views
which of the following statements is true:a complete graph is $(N-1)$ regulara $(N-1)$ regular is a complete graph
1 votes
1 votes
1 answer
3
0 votes
0 votes
2 answers
4