# DISCRETE

0 votes
83 views

Determine whether the graph below has a perfect matching:

(A) Yes

(B) No

in Revision
0
Yes perfect matching is possible, since the number of vertices are even in number.
1
@just_bhavana

inspite of having even number of vertices graph may not have perfect matching since even verices is necessary but not sufficient condition for perfect matching.

though above graph has perfect matching..

## Related questions

0 votes
0 answers
1
104 views
Hi, So I'm studying discrete math and I have some questions: 1.For this question,in the answer we use inexclusive or,why is it wrong to use exclusive or? p: You can use wireless network in the Airport q: You pay the daily fees r: you are subscriber ... 2.Help me figure out this question :translate Actors are not the only people who own an Iphone using propositional logic.. Thanks in advance.
0 votes
0 answers
2
107 views
Let G be a connected 3 - regular graph. Each edge of G lies on some cycle. Let S⊆V and C1,C2,…,Cm,m=Codd(G−S), be the odd component of G−S. Let eG(Ci,S) denote the number of edges with one- end in Ci and the other in S. Then ∑(i=1 to m) eG(Ci−S) is (1) ≤m (2) ≥5m (3) ≥3m
0 votes
0 answers
3
38 views
Consider the preferences given in this Problem Student 1 2 3 4 University 1 2 3 4 A d a b c a C D B A B c b a d b D C A B C c b a d c A C B D D d a b c d B D A C The University - oriented stable matching obtained using Gale-Shapely Algorithm is (1) {aD,bc,cA,dB} (2) {aC,bD,cA,dB} (3) None of the above
0 votes
0 answers
4
32 views
Student 1 2 3 4 University 1 2 3 4 A d a b c a C D B A B c b a d b D C A B C c b a d c A C B D D d a b c d B D A C The Student - oriented stable matching obtained using Gale - Shapely Algorithm is (1) {Aa,Bb,Cc,Dd} (2) {Ac,Ba,Cb,Dd} (3) {Ac,Bd,Cb,Da} (4) None of the above