0

Guest

Courses New

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 60785 Points
one year ago
Our expert is working on this Class XII Maths answer. We will update the answer very soon.
Jayesh Vashishtha
askIITians Faculty 1450 Points
one year 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 ?

Other Related Questions on 10 grade maths

View all Questions »

ASK QUESTION

Get your questions answered by the expert for free

Answer and earn gift vouchers

Win Gift vouchers upto Rs 500/-

View courses by askIITians

Design classes One-on-One in your own way with Top IITians/Medical Professionals

Click Here Know More

Complete Self Study Package designed by Industry Leading Experts

Click Here Know More

Live 1-1 coding classes to unleash the Creator in your Child

Click Here Know More

a Complete All-in-One Study package Fully Loaded inside a Tablet!

Click Here Know More