A Minimal Spanning Tree of a graph Is
All Of These
Explanation for correct options:
A Minimal Spanning Tree of a graph :
A spanning tree is a subset of Graph which has all the vertices covered with the minimum possible number of edges.
A minimum spanning tree also known as a minimum weight spanning tree is a subset of the edges 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.
Hence, the correct option is option(D)