Guest

A minimal spanning tree of a graph G is - A. A spanning subgraph B. A tree C. Minimum weights D. All of the above

A minimal spanning tree of a graph G is -
A. A spanning subgraph
B. A tree
C. Minimum weights
D. All of the above

Grade:12th pass

2 Answers

Pawan Prajapati
askIITians Faculty 60796 Points
3 months ago
Our expert is working on this Class XII Maths answer. We will update the answer very soon.
Jayesh Vashishtha
askIITians Faculty 1449 Points
3 months ago
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

Think You Can Provide A Better Answer ?

Provide a better Answer & Earn Cool Goodies See our forum point policy

ASK QUESTION

Get your questions answered by the expert for free