Register

made easy 2019

• retagged by
897 views
0 0 votes

consider a graph G given below, if the edges are having weight 1,2,3,4,5,6,7,8,9,10; then maximum possible weight a minimum weight spanning tree of G can have is

according to me MST can have weight=10;

what they are asking is about second minimum spanning tree; which according to me can have weight 11

i already searched but didnt find duplicate of this question !

 

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · nielit scientist cNext → · Interprocess Communi...
← Previous in category · tifr 2010Next in category → · Made easy test serie...
Position:
Show:

Related questions

1 1 vote
0 0 answers
956
956 views
Kalpataru Bose asked Dec 31, 2017
956 views
MadeEasy Test Series: Algorithms - Spanning Tree
can someone provide a detailed solution of this??
1 1 vote
1 1 answer
817
817 views
vipul verma asked Aug 25, 2017
817 views
test series( how to solve these type of problems )
1 1 vote
3 3 answers
924
924 views
gatecse asked Aug 4, 2019
924 views
KPGCET-CSE-2019-33
The least running time of creating spanning tree from connected graph in G(E, V) is O (V log V) O (E + V log V)O (E log V) O (V log V + E log V)Where E, V are respect...
63 63 votes
7 answers 7 answers
35.7k
35.7k views
Arjun asked Feb 7, 2019
35,714 views
GATE CSE 2019 | Question: 38
Let $G$ be any connected, weighted, undirected graph.$G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight.$G$ has a unique minimum spanning...