A
Q. If every node u in G is adjacent to every other node v in G, A graph is said to be
- Correct Answer - Option(B)
- Views: 1
- Filed under category Data Structure and Algorithms (DSA)
- Hashtags:
A
No solution found for this question.
Add Solution and get +2 points.
You must be Logged in to update hint/solution
Be the first to start discuss.
Discusssion
Login to discuss.