All possible spanning trees of graph G:
A. have same number of edges and vertices.
B. have same number of edges and but not vertices.
C. have same number of vertices but not edges.
D. depends upon algorithm being used.
Answer:A
All possible spanning trees of graph G:
A. have same number of edges and vertices. B. have same number of edges and but not vertices. C. have same number of vertices but not edges. D. depends upon algorithm being used.