M

Mr. Dubey • 52.30K Points
Coach 

Q. Which graph has a size of minimum vertex cover equal to maximum matching?

(A) cartesian
(B) tree
(C) heap
(D) bipartite
Correct : Option (D)

Explanation: 
 the konig’s theorem given the equivalence relation between the minimum vertex cover and the maximum matching in graph theory. bipartite graph has a size of minimum vertex cover equal to maximum matching.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which mechanism performs an analysis on the code to determine which data items may become unsafe for caching, and they mark those items accordingly?

Q. Quality Assurance methods are usually considered

Q. Complete the following analogy:- Registers are to RAM’s as Cache’s are to

Q. The generic two-level data warehouse architecture includes________.

Q. Which of the following is used to avoid cascading of authorizations from the user?

Q. The step eliminates the extensions of (k-1)-itemsets which are not found to be frequent, from being considered for counting support.

Q. DeMorgan’s first theorem shows the equivalence of

Q. How many approaches can be applied to solve quick hull problem?

Q. The addresses of class A network has subnet mask of .

Q. Terrestrial radio channels are broadly classifed into _____ groups.