If a graph has v vertices and e edges then to obtain a spanning-05657
If a graph has v vertices and e edges then to obtain a spanning tree we have to delete
This multiple choice question (MCQ) is related to the book/course
vu cs502 Fundamentals of Algorithms.
It can also be found in
vu cs502 Final Term - Quiz No.2.
If a graph has v vertices and e edges then to obtain a spanning tree we have to delete
v edges.
v – e + 5 edges
v + e edges.
None of the given
