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...
The graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A, C), (B, C), (...
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Total Unique Visitors
Loading......