Question

A Minimal Spanning Tree of a graph $\mathrm{G}$ Is

• A. A Tree
• B. Minimum Weights
• C. A Spanning Subgraph
• D. All Of These

Answer 1

The correct option is D

All Of These

Explanation for correct options:

A Minimal Spanning Tree of a graph $\mathrm{G}$:

$\bullet$A spanning tree is a subset of Graph $\mathrm{G}$ which has all the vertices covered with the minimum possible number of edges.

$\bullet$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.

$\bullet$A spanning subgraph is a subgraph that contains all the vertices of the original graph.

Hence, the correct option is option(D)