Consider the following graph. Using Kruskal’s algorithm, which edge will be selected first?

Related MCQs

• 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?
• Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?
• From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
• 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?
• Consider the graph shown below. Which of the following are the edges in the MST of the given graph?
• Consider a complete graph G with 4 vertices. The graph G has          spanning trees.
• A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
• Which graph is used to define the claw free graph?
• Which graph cannot contain K3, 3 as a minor of graph?
• Which complete graph is not present in minor of Outer Planar Graph?