Consider the graph shown above. Which of the following are the edges in the MST of the given graph?ans.(a-d)(d-c)(d-b)(d-e)(c-a)(a-d)(d-c)(d-b)(d-e)(a-c)(c-d)(d-b)(d-b)(c-a)(a-d)(d-b)(d-e) Previous Marked for Review Next

Consider the graph shown above. Which of the following are the edges in the MST of the given graph?

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.

Which of the following graphs are bipartite? A B C D

Consider the following directed graph: A / \ E D \ / C | B E->A D->A C->E C->D B->C Which of the following is the adjacency matrix for this graph?

What is the purpose of MST in graph theory?AConnect all vertices with minimum weight of edgesBConnect all the nodes in various waysCConnect all nodes without regard to costBerikutnya