DISCRETE

0 votes

51 views

Determine whether the graph below has a perfect matching:

(A) Yes

(B) No

asked Sep 21, 2017 in Revision by ashutoshsharma (21 points) | 51 views

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

In perfect matching, every vertex is present exactly once. In the image below, as every vertex is present exactly once. It has a perfect matching.

answered Sep 21, 2017 by Hemant Parihar Boss (16.3k points)

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

Discrete math and its applications
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 ... me figure out this question :translate Actors are not the only people who own an Iphone using propositional logic.. Thanks in advance.

asked Nov 9, 2017 in Revision by TheWanderer (15 points) | 56 views

0 votes

0 answers

discrete
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

asked Sep 27, 2017 in Revision by ashutoshsharma (21 points) | 50 views

0 votes

0 answers

discrete
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

asked Sep 27, 2017 in Revision by ashutoshsharma (21 points) | 24 views

0 votes

0 answers

discrete
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

asked Sep 27, 2017 in Revision by ashutoshsharma (21 points) | 21 views

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 Blog Comments

Not really. It was excluding shipping I guess....
Ok sir. Actually pricing on Flipkart is 200 less...
NO.
Is this application open for 2020 graduates i.e....
@Ayush Upadhyaya sir any approximate idea...

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Please log in or register to add a comment.

Related questions

Recent Posts

Recent Blog Comments