If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.

Related MCQs

• Every graph has only one minimum spanning tree.
• 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?
• Which of the following is false in the case of a spanning tree of a graph G?
• What is testing of a complete bipartite subgraph in a bipartite graph problem called?
• Consider a complete graph G with 4 vertices. The graph G has          spanning trees.
• 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?
• How many spanning trees does a complete bipartite graph contain?
• 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?
• The problem of maximizing the sum of weights on edges connecting matched pairs of vertices is?