The Gateway to Computer Science Excellence
0 votes
40 views

Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie between
(A) k and n
(B) k – 1 and k + 1
(C) k – 1 and n – 1
(D) k + 1 and n – k

The answer is C  . how is it k-1?? 

I  mean if we have only one component .?Please explain

closed as a duplicate of: GATE2003-8, ISRO2009-53
in Algorithms by Junior (729 points)
closed by | 40 views
0
if you have only one component means k=1 then suppose you have a graph which has only one vertex(n=1) then after deleting it how many components will be remaining ?

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
50,647 questions
56,508 answers
195,519 comments
100,950 users