Data Structure (DS) MCQ: A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.

A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.

Correct Answer: bipartite

Make the most of this question

This page focuses on one Data Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Data Structure (DS) MCQs All Engineering topics Mock test hub