[Solved] 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.

Q.	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.	partite
B.	bipartite
C.	rooted
D.	bisects
Answer» B. bipartite

View all MCQs in: Data Structure (DS)

Discussion

We want to make our service better for you. Please take a moment to fill out our survey.