A matching M is maximal if and only if there exists no augmenting path with respect to M.

Related MCQs

• What is the length of an augmenting path?
• Maximum matching is also called as maximum cardinality matching.
• A simple acyclic path between source and sink which pass through only positive weighted edges is called?
• Which theorem gives the relation between the minimum vertex cover and maximum matching?
• There is no existing relationship between a Hamiltonian path problem and Hamiltonian circuit problem.
• Which graph has a size of minimum vertex cover equal to maximum matching?
•                            is a matching with the largest number of edges.
• A matching that matches all the vertices of a graph is called?
• In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
• Which one of the following is an application for matching?