A
Q. For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
- Correct Answer - Option(B)
- Views: 14
- 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.