MCQ
Q.
What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
Correct Answer: B
None.