1.

A complete graph can have ...............

A. n^2 spanning trees
B. n^(n-2) spanning trees
C. n^(n+1) spanning trees
D. n^n spanning trees
Answer» C. n^(n+1) spanning trees


Discussion

No Comment Found

Related MCQs