For a complete graph with N vertices, the total number of spanning trees is given by:
A. 2N-1
B. NN-1
C. NN-2
D. 2N+1
Answer:C
For a complete graph with N vertices, the total number of spanning trees is given by:
A. 2N-1 B. NN-1 C. NN-2 D. 2N+1