The Gateway to Computer Science Excellence
+2 votes
124 views

Please can anyone tell whether my answer is wrong or solution provided by them is correct??

in Graph Theory by
edited by | 124 views
0
172 is correct.
0
They're asking for minimum number of edges that should be 19.. why you are giving answer as 172?.. they are not mentioning graph is complete..
0

see the word 'necessarily connected', with 19 edges you can not guarantee necessarily connected condition

0
thanks @nitish

1 Answer

+4 votes
Best answer
Your Answer is Correct .
They had Provided Wrong Solution . And in formula it is > not >= .

$\Rightarrow $ With $171$ edges $19$ vertices can connect completely i.e $K_{19}$

$\Rightarrow \therefore 172$ ensures connection of $20^{th}$ vertex.
by Active
selected by
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,218 questions
59,890 answers
201,085 comments
118,128 users