From a complete graph, by removing maximum ................ edges, we can construct a spanning tree.
A. e-n+1
B. n-e+1
C. n+e-1
D. e-n-1
Answer:A
From a complete graph, by removing maximum ................ edges, we can construct a spanning tree.
A. e-n+1 B. n-e+1 C. n+e-1 D. e-n-1