![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
What is the simplest method to prove that a graph is bipartite? |
A. | it has a cycle of an odd length |
B. | it does not have cycles |
C. | it does not have a cycle of an odd length |
D. | both odd and even cycles are formed |
Answer» C. it does not have a cycle of an odd length | |
Explanation: it is not difficult to prove that a graph is bipartite if and only if it does not have a cycle of an odd length. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet