Login
Remember
Register
Ask a Question
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.
0
votes
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
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
grapg
Please
log in
or
register
to answer this question.
1
Answer
0
votes
answered
Dec 8, 2022
by
Robin
b) bipartite
...
