Open In App

GATE | GATE MOCK 2017 | Question 47

Like Article
Like
Save
Share
Report

You are given a graph containing n vertices and m edges and given that the graph doesn’t contain cycle of odd length. Time Complexity of the best known algorithm to find out whether the graph is bipartite or not is ?

(A)

O(m+n)

(B)

O(1)

(C)

O(mn)

(D)

O(n2)


Answer: (B)

Explanation:

It is by definition that a graph is bipartite if it does not contain odd length cycles. So the answer is O(1).
For more background reading, check this link 
https://proofwiki.org/wiki/Graph_is_Bipartite_iff_No_Odd_Cycles


Quiz of this Question
Please comment below if you find anything wrong in the above post


Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads