. If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraphII.  A subgraph is a graph formed from a subset of the vertices and edges of the original graph. And the subset of vertices includes all endpoints of the subset of the edges. ans.Both I and II are falseBoth I and II are trueI is true and II is falseI is false and II is true Previous Marked for Review Next

Consider a graph G=(V, E), where V = { v1,v2,…,v100 }, E={ (vi, vj) ∣ 1≤ i < j ≤ 100} and the weight of the edge (vi, vj) is ∣i–j∣. The weight of the minimum spanning tree of G is ________.Marks : 1Negative Marks : 0Answer here1009899101

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?ans.Every minimum spanning tree of G must contain CDG has a unique minimum spanning treeIf AB is in a minimum spanning tree, then its removal must disconnect GNo minimum spanning tree contains AB Previous Marked for Review Next

What is a minimum spanning tree (MST) in graph theory?Select one:a. A subtree of a graph that connects all the vertices with the minimum possible total edge weight.b. Any subtree of a graph that includes all of its vertices.c. A subtree that includes the shortest path between every pair of vertices.d. A tree with the minimum number of edges possible.

Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in the matrix W below is the weight of the edge {i, j}. What is the minimum possible weight of a spanning tree T in this graph such that vertex 0 is a leaf node in the tree T?Marks : 1Negative Marks : 0Answer here810710

Every graph has only one minimum spanning tree. State true or false.a)Trueb)False