Request New Subject
Home
Data Structures (DS)
Non Linear Data Structures - Graphs
Q. For a given graph G having v vertices and e edges which is connected and has no cycles, which ofthe following statements is true? (Solved)
1. v=e
2. v = e+1
3. v + 1 = e
4. v = e-1
b. v = e+1
Related Topics
→ Linear Data Structures -Stacks and Queues
→ Non Linear Data Structures - Trees
→ Searching, Sorting and Hashing Techniques
Subscribe Now
Get All Updates & News
Subscribe