Q. Which of the following has maximum clique size 2?

(A) perfect graph
(B) tree
(C) histogram
(D) cartesian

💬 Discuss

✅ Correct Answer: (A) perfect graph

Explanation: the perfect bipartite graph has clique size 2. also, the clique size of compliment of line graph of bipartite graph, compliment of bipartite graph, line graph of bipartite graph and every bipartite graph is 2.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

the perfect bipartite graph has clique size 2. also, the clique size of compliment of line graph of bipartite graph, compliment of bipartite graph, line graph of bipartite graph and every bipartite graph is 2.

💬 Discussion

📊 Question Analytics

👁️

517

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate

Q. Which of the following has maximum clique size 2?

Explanation by: Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics