Register

Graph

1,079 views

2 Answers

0 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 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
Voting & Accepting an answer helps improve the community
← Previous · cacheNext → · Ip addressing
← Previous in category · Ace Test Series: Gr...Next in category → · what is min degree ?
Position:
Show:

Related questions

9 9 votes
1 1 answer
697
697 views
GO Classes asked May 27
697 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Does there exist a simple Eulerian graph on 6 vertices and 7 edges.Enter $1$ for Yes and $0$ for No.
3 3 votes
2 2 answers
392
392 views
GO Classes asked May 27
392 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Does the following graph have a Hamiltonian cycle? Enter $1$ for Yes and $0$ for No.  
3 3 votes
1 1 answer
407
407 views
GO Classes asked May 27
407 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Is the following graph Hamiltonian? Enter $1$ for Yes and $0$ for No.
4 4 votes
4 4 answers
430
430 views
GO Classes asked May 27
430 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Does there exist a graph with the following degree sequence:$$3,3,3,3,5,6,6,6,6,6,6$$Enter $1$ Yes and $0$ for No