[Solved] Every graph has only one minimum spanning tree.

McqMate

Q.	Every graph has only one minimum spanning tree.
A.	true
B.	false
Answer» B. false
Explanation: minimum spanning tree is a spanning tree with the lowest cost among all the spacing trees. sum of all of the edges in the spanning tree is the cost of the spanning tree. there can be many minimum spanning trees for a given graph.

3k

0

Do you find this helpful?

26

View all MCQs in

Design and Analysis of Algorithms

Discussion

No comments yet

Related MCQs

If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
Which of the following is not the algorithm to find the minimum spanning tree of the given graph?
Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?
Consider a complete graph G with 4 vertices. The graph G has spanning trees.
Which of the following is false in the case of a spanning tree of a graph G?
Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
Every Perfect graph has forbidden graph characterization.
How many spanning trees does a complete bipartite graph contain?
Is every complete bipartite graph a Moore Graph.