Login
Remember
Register
Ask a Question
Recent questions tagged grapg
0
votes
1
answer
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.
asked
Dec 8, 2022
in
Data Structures & Algorithms
by
Robin
grapg
To see more, click for the
full list of questions
or
popular tags
.
...
