The number of spanning tree for a complete graph with seven vertices are:
2015
The number of spanning tree for a complete graph with seven vertices are:
- A.
25
- B.
75
- C.
35
- D.
22x5
Attempted by 68 students.
Show answer & explanation
Correct answer: B
Cayley's formula states that the number of spanning trees for a complete graph with n vertices is given by n^(n-2). For a complete graph with seven vertices (n=7), the calculation yields 7^(7-2) = 7^5.
A video solution is available for this question — log in and enroll to watch it.