The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+4 votes
1.6k 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 (14.4k points) | 1.6k 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 (39.2k 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 Boss (6.1k points)
0 votes

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

answered by Veteran (10.7k 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 Veteran (19k points)


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,839 questions
36,692 answers
90,636 comments
34,642 users