Computer Sciences > GATE 2014 SET-2 > Minimum Spanning Tree
The number of distinct minimum spanning trees for the weighted graph below is _______.
[Image of a weighted graph]
[Image of a weighted graph]
Correct : 6
Similar Questions
Let G be any connection, weighted, undirected graph:
I. G has a unique minimum spanning tree if no two edges of G have the same weight.
II. G has a unique m...
Let G be any connection, weighted, undirected graph:
I. G has a unique minimum spanning tree if no two edges of G have the same weight.
II. G has a unique m...
Let G be any connection, weighted, undirected graph:
I. G has a unique minimum spanning tree if no two edges of G have the same weight.
II. G has a unique m...
Total Unique Visitors
Loading......