Question

if a graph contains 10 vertice and 15 edges many edges are required to form a minimum spanning tree

Answer 1

Answer:

15

Explanation:

no

Answer 2

Answer:

9 edges

Explanation:

A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected and undirected graph is a spanning tree with weight less than or equal to the weight of every other spanning tree. The weight of a spanning tree is the sum of weights given to each edge of the spanning tree

A minimum spanning tree has (V – 1) edges where V is the number of vertices in the given graph

The graph contains 10 vertices and 15 edges. So, the minimum spanning tree formed will be having (10 – 1) = 9 edges