Q1083
A matching that matches all the vertices of a graph is called?
A.
Perfect matching
AnswerB.
Cardinality matching
C.
Good matching
D.
Simplex matching
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board