781 views

The number of spanning trees for a complete graph with seven vertices is

1. $2^5$
2. $7^5$
3. $3^5$
4. $2^{2 \times 5}$

No of spanning tree possible in complete graph with n node=nn-2

So No of spanning tree possible in complete graph with 7 node=75

spanning tree possible in complete graph

selected
correct
+1 vote

Number of spanning tree in complete graph have k vertex==K^K-2

Ex::

K=7

No. of spanning tree possible is=7^7-2=7^5

Option B will be right option

The number of spanning trees in the complete graph Kn is nn-2

Number of Spanning trees in Complete Graph of N vertices = N^(N-2)

According to Question:

N=7

So number of spanning trees will be = 7^(7-2)

= 7 ^ 5