M

Mr. Dubey • 52.30K Points
Coach 

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
Correct : Option (A)

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

Share

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. Which of the following is true about SVM? 1. Kernel function map low dimensional data to high dimensional space. 2. It is a similarity Function

Q. Which company is the biggest player in the microprocessor industry?

Q. Software quality assurance is an umbrella activity.

Q. Predict the output of following C++ program. #include<iostream> using namespace std; class Empty {}; int main() { cout << sizeof(Empty); r

Q. To join the internet, the computer has to be connected to a

Q. The main difference between the VLIW and the other approaches to improve performance is

Q. Data intensive applications utilize?

Q. ____________ is the process of exchanging information and understanding between two or more persons.

Q. Which one is not infrastructure software?

Q. Critical defects per unit chip area is for a MOS transistor.