Q. Given that a graph contains no odd cycle. Is it enough to tell that it is bipartite?

(A) yes
(B) no
(C) ---
(D) ---

💬 Discuss

✅ Correct Answer: (A) yes

Explanation: it is required that the graph is connected also. if it is not then it cannot be called a bipartite graph.

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

Explanation by: Mr. Dubey

it is required that the graph is connected also. if it is not then it cannot be called a bipartite graph.

💬 Discussion

📊 Question Analytics

👁️

107

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate