Question

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

A

A Tree

No worries! We‘ve got your back. Try BYJU‘S free classes today!
B

Minimum Weights

No worries! We‘ve got your back. Try BYJU‘S free classes today!
C

A Spanning Subgraph

No worries! We‘ve got your back. Try BYJU‘S free classes today!
D

All Of These

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Open in App
Solution

## The correct option is D All Of TheseExplanation 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)

Suggest Corrections
0
Explore more