A minimal spanning tree of a graph G is -A. A spanning subgraphB. A treeC. Minimum weightsD. All of the above

Dear student,

 

A minimal spanning tree of a graph G is:-
A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges.
A minimum spanning tree or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted (un)directed graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.
 A spanning subgraph is a subgraph that contains all the vertices of the original graph.
 

 

regards,

team Askiitians