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 ?

The Gateway to Computer Science Excellence

0 votes

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

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,647 questions

56,508 answers

195,519 comments

100,950 users