I. If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph II. 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 true Both I and II are false I is false and II is true I is true and II is false

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

Every graph has only one minimum spanning tree. State true or false.a)Falseb)True

Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false?Marks : 1Negative Marks : 0Answer hereEvery minimum spanning tree of G must contain eminG has a unique minimum-spanning treeNo minimum spanning tree contains emaxIf emax is in a minimum spanning tree, then its removal must disconnect GClearPrevNext

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