A complete graph can have ...............
A. n2 spanning trees
B. nn-2 spanning trees
C. nn+1 spanning trees
D. nn spanning trees
Answer:B
A complete graph can have ...............
A. n2 spanning trees B. nn-2 spanning trees C. nn+1 spanning trees D. nn spanning trees