2,356 views
3 votes
3 votes
For a complete graph with 10 vertices, The number of spanning trees is at least_____?

2 Answers

3 votes
3 votes

Exactly 108.

0 votes
0 votes
511

# mst in complete graph<=$2^{n-1^{}}-1$

from classical data structures by Samanta debasis

Related questions

7 votes
7 votes
1 answer
1
vishal chugh asked Jan 18, 2018
2,141 views
The number of distinct minimum spanning trees for the weighted graph shown below is ___________.
1 votes
1 votes
3 answers
3
dd asked Mar 19, 2017
5,515 views
Let $K_n$ denote the complete undirected graph with $n$ vertices where n is an even number. Find the maximum number of spanning trees of $K_n$ that can be formed in such ...
0 votes
0 votes
2 answers
4
Nidhi Budhraja asked Aug 31, 2018
734 views
Q1) Why is the path between a pair of vertices in a minimum Spanning tree of an undirected graph not the shortest( minimum weight) path?