The total number of spanning trees that can be drawn using five labeled vertices is:
A. 125
B. 64
C. 36
D. 16
Answer:A
The total number of spanning trees that can be drawn using five labeled vertices is:
A. 125 B. 64 C. 36 D. 16
Explanation: Cayley devised the well-known formula nn−2 for the number of spanning trees in the complete graph Kn. = 55-2 = 125