Register

minimum spanning is a spanning tree in which removal of any edges disconnnects the tree. True or false?

417 views
0 votes
0 votes
minimum spanning is a spanning tree in which removal of any edges disconnnects the tree.

True or false?
User Avatar

1 Answer

0 votes
0 votes
TRUE

Minimum Spanning tree is a spanning tree that has minimum weight.As far as the question is tree word is sufficient for the answer to be true.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
gshivam63 asked May 31, 2016
1,089 views
This statement is true or false about minimum spanning tree?
If average weight of a minimum spanning tree is Aavg.Then minimum spanning tree will have weight almost (n-1)Aavg, where n is no of vertices in the graph. It is true or false?why?
If average weight of a minimum spanning tree is Aavg.Then minimum spanning tree will have weight almost (n-1)Aavg, where n is no of vertices in the graph. It is true or f...
User Avatar
1 votes
1 votes
1 answer
2
radha gogia asked Feb 20, 2016
387 views
what is the weight of minimum -weight spanning tree in the graph ?
I tried by taking n=2 , and took points (1,1) ,(1,2) ,(2,2),(2,1) and I got the minimum weight to be 3 , which is n+1 but according to answer it is n-1
I tried by taking n=2 , and took points (1,1) ,(1,2) ,(2,2),(2,1) and I got the minimum weight to be 3 , which is n+1 but according to answer it is n-1
User Avatar
Link Copied!