in Mathematical Logic
323 views
1 vote
1 vote

The condition must be            |E| > n-1C2  Isn't it???

in Mathematical Logic
by
323 views

2 Comments

172 is correct answer...

because n-1C2  says then G' with n-1 vertices is complete and G'' having single vertices...G'  is complete graph then this is connected component...for G to be connected these two component also must be connected..

171+1=172

0
0

Thank you @hs_yadav 

0
0

Please log in or register to answer this question.

Related questions

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