The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
MadeEasy Full Length Test 2019: Graph Theory  Vertex Connectivity
+1
vote
92
views
The Vertex Connectivity of Graph is :
1
2
3
None
graphtheory
graphconnectivity
madeeasytestseries2019
madeeasytestseries
asked
Jan 16
in
Graph Theory
by
Na462
Loyal
(
6.6k
points)
edited
Mar 3
by
ajaysoni1924

92
views
answer
comment
0
I am little bit confused in vertex connectivity, please first elaborate it and then answer Please :)
Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof
here
Please
log in
or
register
to answer this question.
1
Answer
+1
vote
Best answer
Vertex Connectivity is the minimum number of vertices that needs to be removed in order to make the graph disconnected. Here the answer seems to be OPTION 2. Tell me if I am wrong about the answer...I'll be happy to help youπ
answered
Jan 16
by
gate_dreams
(
323
points)
selected
Jan 16
by
Na462
comment
0
Thanks Brother :)
Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof
here
β Prev. Qn. in Sub.
Next Qn. in Sub. β
β Prev.
Next β
Related questions
0
votes
0
answers
1
MadeEasy Full Length Test 2018: Graph Theory  Counting
The Number of Labelled possible graph given below ? what I did was β we doesn't remove any of the edge out of 4 = $\binom{4}{0}$ [Because a Graph is subgraph of itself] we can remove any of one edge out of 4 = $\binom{4}{1}$ we can remove any ... out of 4 = $\binom{4}{2}$ similarly , $\binom{4}{3}$ , $\binom{4}{4 }$ then , add of the them
asked
Jan 15
in
Graph Theory
by
Magma
Boss
(
13.6k
points)

92
views
graphtheory
discretemathematics
counting
madeeasytestseries2019
madeeasytestseries
0
votes
0
answers
2
MadeEasy Test Series: Graph Theory  Graph Connectivity
if m=4 and n=6 (complete graph) option B says removal of mC2n+2 = 66+2=2 edges. but it needs 3 edges to make the graph disconnected. how B is answer?
asked
Dec 8, 2016
in
Graph Theory
by
Anusha Motamarri
Boss
(
11.9k
points)

161
views
madeeasytestseries
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
0
votes
1
answer
3
Zeal Test Series 2019: Graph Theory  Graph Connectivity
asked
Dec 22, 2018
in
Graph Theory
by
Prince Sindhiya
Loyal
(
5.4k
points)

71
views
zeal
graphtheory
graphconnectivity
zeal2019
+2
votes
0
answers
4
Zeal Test Series 2019: Graph Theory  Graph Connectivity
i didn't read the concept related to strongly connected components please it describe it for this question
asked
Nov 11, 2018
in
Graph Theory
by
Prince Sindhiya
Loyal
(
5.4k
points)

104
views
zeal
graphtheory
discretemathematics
graphconnectivity
zeal2019
+1
vote
2
answers
5
MadeEasy Subject Test 2019: Graph Thoery  Graph Coloring
The number of vertices,edges and colors required for proper coloring in Tripartite graph K<3,2,5> will be : 10 , 31 , 3 10 , 30 , 3 10 , 30 , 2 None
asked
Jan 16
in
Graph Theory
by
Na462
Loyal
(
6.6k
points)

88
views
discretemathematics
graphtheory
madeeasytestseries2019
madeeasytestseries
0
votes
0
answers
6
Gateforum Test Series: Graph Theory  Graph connectivity
asked
Oct 29, 2018
in
Graph Theory
by
Gupta731
Active
(
4.5k
points)

79
views
discretemathematics
graphtheory
gateforumtestseries
graphconnectivity
+2
votes
1
answer
7
Ace Test series: Graph Theory  Graph Connectivity
Please can anyone tell whether my answer is wrong or solution provided by them is correct??
asked
Jan 8, 2018
in
Graph Theory
by
Asim Abbas
(
155
points)

98
views
acetestseries
graphtheory
graphconnectivity
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
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
Recent Posts
IIITH Interview Experience
Thanks GO!!
IIIT Hyerabad Interview Expeience  MS by Research in CSE
The day that made me an IIScian :)
Unanswered Previous year GATE/TIFR questions
All categories
General Aptitude
1.8k
Engineering Mathematics
7.3k
Discrete Mathematics
5.1k
Mathematical Logic
2.1k
Set Theory & Algebra
1.4k
Combinatory
873
Graph Theory
803
Probability
992
Linear Algebra
685
Calculus
488
Digital Logic
2.9k
Programming & DS
4.9k
Algorithms
4.3k
Theory of Computation
6k
Compiler Design
2k
Operating System
4.2k
Databases
4.1k
CO & Architecture
3.4k
Computer Networks
4.1k
Non GATE
1.4k
Others
1.4k
Admissions
596
Exam Queries
577
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent Blog Comments
Congratulations :)
Congratulations π π
Thank you bro @Shaik
Thank you Sir.
congratulations :)
49,532
questions
54,123
answers
187,319
comments
71,044
users