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
MadeEasy Full Length Test 2019: Graph Theory  Vertex Connectivity
+1
vote
163
views
The Vertex Connectivity of Graph is :
1
2
3
None
graphtheory
graphconnectivity
madeeasytestseries2019
madeeasytestseries
asked
Jan 16, 2019
in
Graph Theory
by
Na462
Loyal
(
7.1k
points)
edited
Mar 3, 2019
by
ajaysoni1924

163
views
answer
comment
0
I am little bit confused in vertex connectivity, please first elaborate it and then answer Please :)
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
+3
votes
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, 2019
by
gate_dreams
(
343
points)
selected
Jan 16, 2019
by
Na462
comment
0
Thanks Brother :)
Please
log in
or
register
to add a comment.
β 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, 2019
in
Graph Theory
by
Magma
Boss
(
13.9k
points)

114
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
(
12k
points)

189
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.9k
points)

131
views
zeal
graphtheory
graphconnectivity
zeal2019
+3
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.9k
points)

144
views
zeal
graphtheory
discretemathematics
graphconnectivity
zeal2019
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
GATE CSE: All NITs Admissions
GATE CSE: IIT Hyderabad Admissions
GATE CSE: IIT Guwahati Admissions
GATE CSE: IIT Delhi Admissions
GATE CSE: IIT Kanpur Admissions
All categories
General Aptitude
1.9k
Engineering Mathematics
7.6k
Discrete Mathematics
5.2k
Mathematical Logic
2.1k
Set Theory & Algebra
1.4k
Combinatory
916
Graph Theory
825
Probability
1k
Linear Algebra
727
Calculus
594
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.4k
Others
1.5k
Admissions
595
Exam Queries
573
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent Blog Comments
Any idea when the cutoff for interview will be...
770 was the cut off score for GEN NON EWS IITK...
I have heard that everyone who had score 650+ and...
Thanks @Hira Thakur.
@MiNiPanda Well, I'm not sure of the...
50,833
questions
57,748
answers
199,478
comments
108,137
users