1.

All closed walks are of ______ length in a bipartite graph.(a) infinite(b) even(c) odd(d) odd primeThis question was posed to me in an internship interview.I'd like to ask this question from Bipartite Graphs topic in portion Graphs of Discrete Mathematics

Answer» RIGHT choice is (b) even

Easy EXPLANATION: In a BIPARTITE graph G all CLOSED walks must be of even length as well as all cycles in G are of even length. Then only the graph is considered a bipartite graph.


Discussion

No Comment Found

Related InterviewSolutions