edited by
6,834 views
7 votes
7 votes

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}$
edited by

5 Answers

2 votes
2 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

1 votes
1 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
0 votes
0 votes

number of spanning trees of a complete graph with n vertices  = $n^{n-2}$

here n = 7

ans = $7^{5}$

Answer:

Related questions

53 votes
53 votes
4 answers
1
10 votes
10 votes
2 answers
2
ish.nit513 asked May 19, 2015
10,566 views
A machine needs a minimum of $100$ sec to sort $1000$ names by quick sort. The minimum time needed to sort $100$ names will be approximately$50.2$ sec$6.7$ sec$72.7$ sec$...
48 votes
48 votes
2 answers
3
Kathleen asked Sep 23, 2014
22,541 views
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$then the o...
31 votes
31 votes
6 answers
4
Kathleen asked Sep 18, 2014
19,267 views
The time complexity of the following C function is (assume $n 0$)int recursive (int n) { if(n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); }$O(n)$$...