A matching that matches all the vertices of a graph is called?

M

Mr. Dubey

🎓 Coach ⭐ 103.80K Points

📊 Design and Analysis of Algorithms

Q. A matching that matches all the vertices of a graph is called?

(A) perfect matching
(B) cardinality matching
(C) good matching
(D) simplex matching

💬 Discuss

✅ Correct Answer: (A) perfect matching

Explanation: a matching that matches all the vertices of a graph is called perfect matching.

Explanation by: Mr. Dubey

a matching that matches all the vertices of a graph is called perfect matching.

💬 Discussion

📊 Question Analytics

👁️

361

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

91%

Success Rate