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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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
1
answer
1
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
in
Graph Theory
by
Na462
Active
(
4k
points)

30
views
graphmatching
+1
vote
2
answers
2
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
(
4.9k
points)

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

90
views
graphtheory
graphmatching
+1
vote
0
answers
4
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
(
4.9k
points)

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

307
views
engineeringmathematics
graphtheory
graphmatching
+2
votes
2
answers
6
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)

171
views
graphtheory
graphmatching
graphconnectivity
spanningtree
+1
vote
3
answers
7
[Discrete Maths] Graph Theory Rosen,Chromatic number
asked
Jun 13, 2017
in
Mathematical Logic
by
rahul sharma 5
Boss
(
24.3k
points)

319
views
graphtheory
discretemathematics
graphconnectivity
graphmatching
0
votes
1
answer
8
[Discrete maths] graph theory Perfect matching
asked
Jun 8, 2017
in
Mathematical Logic
by
rahul sharma 5
Boss
(
24.3k
points)

190
views
graphtheory
graphmatching
0
votes
1
answer
9
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
(
2k
points)

142
views
perfect
graphmatching
+2
votes
2
answers
10
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
(
263
points)

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

218
views
virtualgate
graphmatching
graphtheory
+3
votes
2
answers
12
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.1k
points)

554
views
graphtheory
graphmatching
+8
votes
2
answers
13
no of perfect matching in complete graph
asked
Dec 2, 2014
in
Graph Theory
by
dhingrak
Active
(
1.3k
points)

1.9k
views
graphmatching
+29
votes
5
answers
14
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.5k
points)

3.4k
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
AAI Junior Exceutive(Information Technology)
The 2018 APL Problem Solving Contest
GO Classroom for GATE 2019
Mtech CSE  IITH (TA) Interview Experience
MS Programme @ IIT
Follow @csegate
Gatecse
Recent questions tagged graphmatching
Recent Blog Comments
You are welcome.
Oh ok..got it now! Thank you Sir!!
@Arjun Thank You sir.. it is working now.
@Karan Now it should work for you as well as ...
@Sumaiya The red mark is normal  it is just for ...
37,056
questions
44,636
answers
127,000
comments
43,686
users