📊 Design and Analysis of Algorithms
Q. Every Perfect graph has forbidden graph characterization.
  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
💬 Discuss
✅ Correct Answer: (A) true

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

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

💬 Discussion

Related MCQs

Q. Which interval notation represents the set of numbers that are greater than or equal to -1, but are less than 9?

Q. Suppose there are 25 base classifiers. Each classifier has error rates of e = 0.35. Suppose you are using averaging as ensemble technique. What will b

Q. is a document to convey the Aadhaar number to a resident.

Q. Which is a software configuration management concept that helps us to control change without seriously impeding justifiable change?

Q. Which of the following is one of the basic approaches for joining tables?

Q. HLDA stands for

Q. Which one is not be structured design model ?

Q. the boolean expression AB'CD'is

Q. Which calculus is based on specifying a number of tuple variables:

Q. In a database system there is:

📊 Question Analytics

👁️
270
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
96%
Success Rate