The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
Recent questions tagged graphmatching
0
votes
0
answers
1
GeeksforGeeks
Let G be a graph with no isolated vertices, and let M be a maximum matching of G. For each vertex v not saturated by M, choose an edge incident to v. Let T be the set of all the chosen edges, and let L = M ∪ T. Which of the following option is TRUE? A L is always ... G. B L is always a minimum edge cover of G. C Both (A) and (B) D Neither (A) nor (B) Can anyone pls help solving this?
asked
Jan 30
in
Graph Theory
by
Ashish Goyal
(
343
points)

102
views
graphmatching
discretemathematics
graphtheory
testseries
0
votes
0
answers
2
Gateforum Test Series: Graph Theory  Graph Matching
asked
Jan 2
in
Graph Theory
by
Gupta731
Active
(
4.5k
points)

38
views
gateforumtestseries
discretemathematics
graphtheory
graphmatching
+1
vote
1
answer
3
Zeal Test Series 2019: Graph Theory  Graph Matching
asked
Dec 22, 2018
in
Graph Theory
by
Prince Sindhiya
Loyal
(
6.2k
points)

54
views
zeal
discretemathematics
graphtheory
graphmatching
zeal2019
0
votes
1
answer
4
Complete Matching
Consider the Bipartite graph shown. If four edges are chosen at random, what is the probability that they form a complete matching from V1 to V2 ? A. 0.039 B. 0.052 C. 0.071 D. 0.083
asked
Oct 13, 2018
in
Mathematical Logic
by
Na462
Loyal
(
8.7k
points)

101
views
graphmatching
graphtheory
discretemathematics
+1
vote
1
answer
5
ACE Bits And Bytes
Number of perfect matching in Wn (n>=4 and n is even) _________.
asked
Jul 24, 2018
in
Graph Theory
by
abhishek1995_cse
(
167
points)

90
views
graphtheory
graphmatching
gate2019
0
votes
1
answer
6
Perfect Matching
Perfect matching is a set of edges such that each vertex appears only once and all vertices appear at least once (EXACTLY one appearance). So for n vertices perfect matching will have n/2 edges and there won't be any perfect matching if n is odd. ... 't know whether i got it properly or not. Can please anybody explain the Perfect matching in a complete graph with simpler examples ?
asked
Jun 10, 2018
in
Graph Theory
by
Na462
Loyal
(
8.7k
points)

92
views
graphmatching
+1
vote
1
answer
7
Ace Test Series: Graph Theory  Matching
my answer is C but the answer given is A someone please explain
asked
Jan 20, 2018
in
Graph Theory
by
ashish pal
Active
(
1.2k
points)

81
views
acetestseries
graphtheory
graphmatching
+1
vote
2
answers
8
graph theory
Maximum no of edges in a trianglefree, simple planar graph with 10 vertices
asked
Dec 23, 2017
in
Graph Theory
by
Parshu gate
Active
(
5.1k
points)

199
views
graphtheory
discretemathematics
graphconnectivity
graphmatching
engineeringmathematics
+2
votes
1
answer
9
Matchings in a Graph
asked
Nov 29, 2017
in
Graph Theory
by
Parshu gate
Active
(
5.1k
points)

142
views
graphtheory
graphmatching
+2
votes
0
answers
10
chromatic number
Let G be a planar Graph Such that every phase is bordered by exactly 3 edges which of the following can never be value for X(G) a)2 b)3 C)4 d)none of these
asked
Nov 11, 2017
in
Graph Theory
by
Parshu gate
Active
(
5.1k
points)

228
views
graphtheory
discretemathematics
graphconnectivity
graphmatching
graphcoloring
+1
vote
2
answers
11
PERFECT MATCHING IN COMPLETE GRAPH
asked
Nov 6, 2017
in
Graph Theory
by
Parshu gate
Active
(
5.1k
points)

486
views
engineeringmathematics
graphtheory
graphmatching
+2
votes
2
answers
12
Graph Theory
Consider a 'reversed Kruskal' Algorithm for computing a MST. Initialize T to be the set of all edges in the graph. Now consider edges from largest to smallest cost. For each edge, delete it from T if that edge belongs to a cycle in T. Assuming all the edge costs are distinct, does this new algorithm correctly compute a MST? a) Yes b) no c) cant say
asked
Sep 14, 2017
in
Graph Theory
by
Rakshit Gupta
(
33
points)

203
views
graphtheory
graphmatching
graphconnectivity
spanningtree
+3
votes
3
answers
13
[Discrete Maths] Graph Theory Rosen,Chromatic number
What are the chromatic number of following graphs? Answer is 6 and 4 respectively.But i am getting 3 for both. Please someone confirm this?
asked
Jun 13, 2017
in
Mathematical Logic
by
rahul sharma 5
Boss
(
26.8k
points)

385
views
graphtheory
discretemathematics
graphconnectivity
graphmatching
0
votes
1
answer
14
[Discrete maths] graph theory Perfect matching
When matching number and covering number are same then can we say that it is a perfect matching case?Do i need to check the elements of the set( edges in both matching and covering) also if their cardinality is same?If yes,then can someone give me ... but still it is not a perfect match?I am not able to find such a case and i think it will not exist.
asked
Jun 8, 2017
in
Mathematical Logic
by
rahul sharma 5
Boss
(
26.8k
points)

236
views
graphtheory
graphmatching
0
votes
1
answer
15
narsingh deo
In a village there are equal no of boys and girls of marriageable age.Each boy dates a certain no. of girls and each girl dates a certain number of boys,under what condition is it possible that every girl and boy gets married to one of their dates?
asked
Feb 27, 2017
in
Graph Theory
by
Learner_jai
Active
(
2.6k
points)

154
views
perfect
graphmatching
+2
votes
3
answers
16
made easy
Please explain how perfect matching in given tree is 1? Why not 3 with edges ab,ce,df?
asked
Aug 10, 2016
in
Mathematical Logic
by
gaurav9822
(
273
points)

244
views
perfectmatching
discretemathematics
graphmatching
+4
votes
2
answers
17
VIRTUALGATE II Q.14
Find the matching number for the given graph
asked
Jan 26, 2016
in
Graph Theory
by
learncp
Active
(
1.5k
points)

246
views
virtualgate
graphmatching
graphtheory
+4
votes
2
answers
18
Finding matching number of graph
Given explanation: In the above explanation, it is written that matching number is 4 but I am getting matching number as 3 for this graph(choosing edges 12, 34 and 67). Please check where I am going wrong
asked
Jan 19, 2016
in
Graph Theory
by
shikharV
Active
(
4.3k
points)

714
views
graphtheory
graphmatching
+9
votes
2
answers
19
no of perfect matching in complete graph
Is there a way to find no of perfect matchings in a complete graph Kn where n could be either even or odd..?
asked
Dec 2, 2014
in
Graph Theory
by
dhingrak
Active
(
1.4k
points)

2.8k
views
graphmatching
+33
votes
5
answers
20
GATE200336
How many perfect matching are there in a complete graph of $6$ vertices? $15$ $24$ $30$ $60$
asked
Sep 16, 2014
in
Graph Theory
by
Kathleen
Veteran
(
59.9k
points)

4.5k
views
gate2003
graphtheory
graphmatching
normal
To see more, click for the
full list of questions
or
popular tags
.
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
IIT Gandhinagar review
Is DAIICT good for doing MTech ?
AIR175 : GO is enough
GATE 2019 My reasoned routine. (AIR 558)
if i can you also can
Follow @csegate
Recent questions tagged graphmatching
Recent Blog Comments
Many times Anger , Aggression and Fear push...
One word would be "Priorities" Second word shall...
What's interesting to me is that despite having...
Brother!! your all posts are really worth to read...
Publication is not a strict requirement but you...
48,634
questions
52,768
answers
183,405
comments
68,307
users