retagged by
369 views
0 votes
0 votes
how many numbers of MST possible for n vertex:

1. all the weight edges are distinct

2. all the weight edges are different
retagged by

1 Answer

0 votes
0 votes
I see you both questions are same.

Minimum Spanning Tree possible for distinct weight edges = 1.

Minimum Spanning Tree possible for graph which does not have all edges distinct is >1 but cost of each such Minimum Spanning Tree will be same.

Related questions

1 votes
1 votes
1 answer
1
srestha asked Dec 9, 2016
723 views
Which one of the following is true?1) For any graph G Kruskal and Prims both give same MST.2)The running time of Prims algo can be improved if we use Fibonacci Heap inste...
0 votes
0 votes
1 answer
2
0 votes
0 votes
0 answers
4
Naveen Kumar 3 asked Nov 10, 2018
630 views
Let us assume that $G$($V$, $E$) is a weighted complete graph such that weight of the edge <$V_K$,$V_L$>=2|$K$-$L$|. The weight MST of $G$ with 100 vertices is __________...