Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged graph-matching
3
votes
0
answers
1
DRDO CSE 2022 Paper 1 | Question: 9
Count the number of perfect matchings in the bipartite graph whose adjacency matrix $\text{A}$ is as follows. \[\left[\begin{array}{lll} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 1 & 1 \end{array}\right]\]
Count the number of perfect matchings in the bipartite graph whose adjacency matrix $\text{A}$ is as follows.\[\left[\begin{array}{lll}1 & 1 & 0 \\0 & 1 & 1 \\1 & 1 & 1\e...
admin
372
views
admin
asked
Dec 15, 2022
Graph Theory
drdocse-2022-paper1
graph-theory
bipartite-graph
graph-matching
4-marks
descriptive
+
–
4
votes
2
answers
2
TIFR CSE 2022 | Part B | Question: 2
Let $G=(V, E)$ be an undirected simple graph. A subset $M \subseteq E$ is a matching in $G$ if distinct edges in $M$ do not share a vertex. A matching is maximal if no strict superset of $M$ is a matching. How many maximal matchings does the following graph have? $1$ $2$ $3$ $4$ $5$
Let $G=(V, E)$ be an undirected simple graph. A subset $M \subseteq E$ is a matching in $G$ if distinct edges in $M$ do not share a vertex. A matching is maximal if no st...
admin
920
views
admin
asked
Sep 1, 2022
Graph Theory
tifr2022
graph-theory
graph-matching
+
–
3
votes
1
answer
3
TIFR CSE 2022 | Part B | Question: 6
We are given a graph $G$ along with a matching $M$ and a vertex cover $C$ in it such that $|M|=|C|$. Consider the following statements: $M$ is a maximum matching in $G$. $C$ is a minimum vertex cover in $G$. $G$ is a bipartite graph. Which of ... $(1)$ and $(2)$ are correct All the three statements $(1), (2),$ and $(3)$ are correct
We are given a graph $G$ along with a matching $M$ and a vertex cover $C$ in it such that $|M|=|C|$. Consider the following statements:$M$ is a maximum matching in $G$.$C...
admin
902
views
admin
asked
Sep 1, 2022
Graph Theory
tifr2022
graph-theory
graph-matching
+
–
0
votes
0
answers
4
Best Open Video Playlist for Graph Theory: Matching Topic | Discrete Mathematics
Please list out the best free available video playlist for Graph Theory: Matching Topic from Discrete Mathematics as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO ... ones are more likely to be selected as best. For the full list of selected videos please see here
Please list out the best free available video playlist for Graph Theory: Matching Topic from Discrete Mathematics as an answer here (only one playlist per answer). We'll ...
makhdoom ghaya
185
views
makhdoom ghaya
asked
Aug 14, 2022
Study Resources
missing-videos
free-videos
video-links
go-classroom
graph-theory
graph-matching
+
–
2
votes
1
answer
5
GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 13
For the following graph, what is the summation of chromatic number and matching number?
For the following graph, what is the summation of chromatic number and matching number?
GO Classes
388
views
GO Classes
asked
May 11, 2022
Graph Theory
goclasses2024-dm-5-weekly-quiz
numerical-answers
goclasses
graph-theory
graph-matching
2-marks
+
–
1
votes
1
answer
6
TIFR CSE 2021 | Part A | Question: 6
A matching in a graph is a set of edges such that no two edges in the set share a common vertex. Let $G$ be a graph on $n$ $\textit{vertices}$ in which there is a subset $M$ of $m$ $\textit{edges}$ which is a matching. Consider a random process where each vertex in the ... $\left ( 1-p^{2} \right )^{m}$ $1-\left ( 1-p\left ( 1-p \right ) \right )^{m}$
A matching in a graph is a set of edges such that no two edges in the set share a common vertex. Let $G$ be a graph on $n$ $\textit{vertices}$ in which there is a subset ...
soujanyareddy13
724
views
soujanyareddy13
asked
Mar 25, 2021
Graph Theory
tifr2021
graph-theory
graph-matching
probability
+
–
1
votes
1
answer
7
CMI2018-A-9
Your college has sent a contingent to take part in a cultural festival at a neighbouring institution. Several team events are part of the programme. Each event takes place through the day with many elimination rounds. Your contingent is multi-talented ... : Find a maximum length simple cycle Find a maximum size independent set Find a maximum matching Find a maximal connected component
Your college has sent a contingent to take part in a cultural festival at a neighbouring institution. Several team events are part of the programme. Each event takes plac...
gatecse
759
views
gatecse
asked
Sep 13, 2019
Graph Theory
cmi2018
graph-theory
graph-connectivity
graph-matching
independent-set
descriptive
+
–
1
votes
0
answers
8
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?
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 ...
Ashish Goyal
1.5k
views
Ashish Goyal
asked
Jan 30, 2019
Graph Theory
graph-matching
discrete-mathematics
graph-theory
test-series
+
–
0
votes
2
answers
9
Gateforum Test Series: Graph Theory - Graph Matching
Gupta731
833
views
Gupta731
asked
Jan 2, 2019
Graph Theory
gateforum-test-series
discrete-mathematics
graph-theory
graph-matching
+
–
3
votes
1
answer
10
Zeal Test Series 2019: Graph Theory - Graph Matching
Prince Sindhiya
702
views
Prince Sindhiya
asked
Dec 21, 2018
Graph Theory
zeal
discrete-mathematics
graph-theory
graph-matching
zeal2019
+
–
0
votes
1
answer
11
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
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.039B. 0.052C. 0.071...
Na462
1.7k
views
Na462
asked
Oct 13, 2018
Mathematical Logic
graph-matching
graph-theory
discrete-mathematics
+
–
1
votes
1
answer
12
ACE Bits And Bytes
Number of perfect matching in Wn (n>=4 and n is even) _________.
Number of perfect matching in Wn (n>=4 and n is even) _________.
abhishek1995_cse
590
views
abhishek1995_cse
asked
Jul 23, 2018
Graph Theory
graph-theory
graph-matching
+
–
0
votes
1
answer
13
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 ... t know whether i got it properly or not. Can please anybody explain the Perfect matching in a complete graph with simpler examples ?
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 match...
Na462
1.0k
views
Na462
asked
Jun 10, 2018
Graph Theory
graph-matching
+
–
1
votes
1
answer
14
Ace Test Series: Graph Theory - Matching
my answer is C but the answer given is A someone please explain
my answer is Cbut the answer given is Asomeone please explain
ashish pal
479
views
ashish pal
asked
Jan 20, 2018
Graph Theory
ace-test-series
graph-theory
graph-matching
+
–
0
votes
1
answer
15
Matching number in complete bipartitite graph
I am not convinced by this. Please explain or please tell me the source from where I can clear this out.
I am not convinced by this. Please explain or please tell me the source from where I can clear this out.
atul_21
509
views
atul_21
asked
Dec 21, 2017
Graph Theory
discrete-mathematics
graph-theory
graph-matching
+
–
0
votes
0
answers
16
PERFECT MATCHING
Consider complete graphs K5 and K6 . Let X5 and X6 are number of perfect matching of K5 and K6 respectively. Then X5 + X6 = ________.
Consider complete graphs K5 and K6 . Let X5 and X6 are number of perfect matching of K5 and K6 respectively. Then X5 + X6 = ________.
Jaspreet Kaur Bains
1.7k
views
Jaspreet Kaur Bains
asked
Dec 19, 2017
Graph Theory
discrete-mathematics
graph-theory
graph-matching
+
–
2
votes
1
answer
17
Matchings in a Graph
Parshu gate
601
views
Parshu gate
asked
Nov 28, 2017
Graph Theory
graph-theory
graph-matching
+
–
1
votes
2
answers
18
PERFECT MATCHING IN COMPLETE GRAPH
Parshu gate
2.7k
views
Parshu gate
asked
Nov 6, 2017
Graph Theory
discrete-mathematics
graph-theory
graph-matching
+
–
0
votes
1
answer
19
DISCRETE
Let T be a tree with n vertices and k be the maximum size of an independent set in T. Then the size of maximum matching in T is (A) k (B) n−k (C) (n−1)/2
Let T be a tree with n vertices and k be the maximum size of an independent set in T. Then the size of maximum matching in T is(A) k(B) n−k(C) (n−1)/2
ashutoshsharma
446
views
ashutoshsharma
asked
Sep 21, 2017
Graph Theory
graph-matching
+
–
2
votes
2
answers
20
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
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 e...
Rakshit Gupta
1.3k
views
Rakshit Gupta
asked
Sep 13, 2017
Graph Theory
graph-theory
graph-matching
graph-connectivity
spanning-tree
+
–
0
votes
1
answer
21
[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.
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 an...
rahul sharma 5
1.1k
views
rahul sharma 5
asked
Jun 8, 2017
Mathematical Logic
graph-theory
graph-matching
+
–
0
votes
1
answer
22
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?
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 cond...
Learner_jai
743
views
Learner_jai
asked
Feb 27, 2017
Graph Theory
perfect
graph-matching
+
–
2
votes
1
answer
23
MATCHING NUMBER
what is the matching number of $K_{2,3}$ graph.and also explain matching number of $K_{m,n}$(simplification).
what is the matching number of $K_{2,3}$ graph.and also explain matching number of $K_{m,n}$(simplification).
santhoshdevulapally
397
views
santhoshdevulapally
asked
Dec 31, 2016
Graph Theory
graph-theory
graph-matching
+
–
4
votes
1
answer
24
Find chromatic number and matching number of a graph
Rohan Mundhey
2.7k
views
Rohan Mundhey
asked
Oct 14, 2016
Graph Theory
discrete-mathematics
graph-theory
graph-matching
ace-test-series
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register