1

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

Correct Answer: perfect matching

Make the most of this question

This page focuses on one Design and Analysis of Algorithms question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Design and Analysis of Algorithms MCQ: A matching that matches all the vertices of a graph is called? | Extra Education