Question

What is a bipartite graph?

(a) a graph which contains only one cycle

(b) a graph which consists of more than 3 number of vertices

(c) a graph which has odd number of vertices and even number of edges

(d) a graph which contains no cycles of odd length

I have been asked this question by my school teacher while I was bunking the class.

The doubt is from Properties of Tree topic in division Trees of Discrete Mathematics

Answer 1

The correct answer is (d) a graph which contains no cycles of odd length

Explanation: A graph is called a bipartite graph if and only if it contains no cycle of odd length. Every tree is a bipartite graph and a median graph.