The Gateway to Computer Science Excellence
0 votes

Determine whether the graph below has a perfect matching:

(A)  Yes

(B) No

in Revision by (21 points) | 51 views

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.

by Boss (16.3k points)

Related questions

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
50,647 questions
56,459 answers
100,272 users