GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
595 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.7k points)   | 595 views

3 Answers

+12 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 (36.3k points)  
selected by
correct
0 votes

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

answered by Loyal (3.8k points)  
0 votes

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.5k points)  


Top Users Mar 2017
  1. rude

    4018 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2606 Points

  5. Debashish Deka

    2092 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1318 Points

  8. Bikram

    1218 Points

  9. Akriti sood

    1166 Points

  10. Sanjay Sharma

    1004 Points

Monthly Topper: Rs. 500 gift card

21,439 questions
26,753 answers
60,919 comments
22,929 users