GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
1.3k 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}$
asked in Algorithms by Veteran (13.9k points)   | 1.3k views

4 Answers

+13 votes
Best answer

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

answered by Veteran (37.1k points)  
selected by
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

answered by Loyal (4.8k points)  
0 votes

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

answered by Boss (6.1k points)  
0 votes
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
answered by Boss (9.7k points)  


Top Users Jul 2017
  1. Bikram

    3960 Points

  2. manu00x

    2464 Points

  3. Debashish Deka

    1848 Points

  4. joshi_nitish

    1654 Points

  5. Arjun

    1290 Points

  6. Hemant Parihar

    1184 Points

  7. Arnab Bhadra

    1100 Points

  8. Shubhanshu

    1052 Points

  9. Ahwan

    900 Points

  10. rahul sharma 5

    702 Points


24,018 questions
30,955 answers
70,326 comments
29,337 users