M

Mr. Dubey • 52.30K Points
Coach 

Q. Every Perfect graph has forbidden graph characterization.

(A) true
(B) false
(C) ---
(D) ---
Correct : Option (A)

Explanation: 
 berge theorem proves the forbidden graph characterization of every perfect graphs. because of that reason every bipartite graph is perfect graph.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. A processor performing fetch or decoding of different instruction during the execution of another instruction is called ______ .

Q. A relation (34 × 78) × 57 = 57 × (78 × 34) can have property.

Q. structured design was developed by ----- and --------------------.

Q. In _______ the virtual machine simulates hardware, so it can be independent of the underlying system hardware.

Q. A control model where one system component is designed as system manager which controls the starting, stopping and coordination other system processes

Q. The register which keeps track of the execution of a program and which contains the memory address of the instruction currently being executed is call

Q. A cable with single copper core and braided metal shield is called .

Q. Manpower planning is

Q. ___________ pattern ensure a class only has one instance and provide a global point of access to it.

Q. What are the disadvantages of arrays?