0 votes
in Data Structures & Algorithms by
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

1 Answer

0 votes
by
b) bipartite
...