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
114
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.7k
points)
edited
Mar 3
by
ajaysoni1924

114
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
+2
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
by
gate_dreams
(
333
points)
selected
Jan 16
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
in
Graph Theory
by
Magma
Boss
(
13.6k
points)

100
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)

169
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.5k
points)

100
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.5k
points)

119
views
zeal
graphtheory
discretemathematics
graphconnectivity
zeal2019
0
votes
0
answers
5
MadeEasy Full Length Test 2019: Theory of Computation  Finite Automata
Let L = {w w ∈ {0,1}*; w contains 01 and 011 as substring}. The number of states in the minimal DFA corresponding to the complement of L is equal to My Answer: Correct if I am wrong. Its complement will be all ... don't have 01 as substring. so if we make its dfa then minimum number of states will be 3. Answer given is 4
asked
Jan 28
in
Theory of Computation
by
Mayank Bansal
(
75
points)

95
views
finiteautomata
theoryofcomputation
madeeasytestseries2019
madeeasytestseries
0
votes
0
answers
6
MadeEasy Full Length Test 2019: Theory of Computation  Identify Class Languages
asked
Jan 15
in
Theory of Computation
by
MiNiPanda
Boss
(
22.3k
points)

193
views
identifyclasslanguage
theoryofcomputation
madeeasytestseries2019
madeeasytestseries
+1
vote
1
answer
7
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.7k
points)

99
views
discretemathematics
graphtheory
madeeasytestseries2019
madeeasytestseries
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
Previous Years Question Papers : ISI  MMA, PCB, DCG
Previous Years Question Papers : CMI  Computer Science
Minimum Number of States in a DFA accepting a binary number divisible by 'n'
GATE 2020 Application Form Opened!
My GATE Preparation Journey
All categories
General Aptitude
1.8k
Engineering Mathematics
7.3k
Discrete Mathematics
5.1k
Mathematical Logic
2.1k
Set Theory & Algebra
1.3k
Combinatory
879
Graph Theory
805
Probability
987
Linear Algebra
682
Calculus
489
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.4k
Theory of Computation
6.1k
Compiler Design
2.1k
Operating System
4.2k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.1k
Non GATE
1.5k
Others
1.7k
Admissions
595
Exam Queries
576
Tier 1 Placement Questions
23
Job Queries
72
Projects
17
Follow @csegate
Recent Blog Comments
Thanks for this post.
Thanks a ton for sharing this.
Thank you Arjun Sir.. Your blogs inspire a lot..
Feedback for next edition (if ever there's...
50,093
questions
55,328
answers
190,852
comments
86,255
users