All closed walks are of ______ length in a bipartite graph.
(a) infinite
(b) even
(c) odd
(d) odd prime
This 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