723 views

1 Answer

Best answer
7 votes
7 votes

The given statement is false..

The reason being :

a) A spanning tree is a subgraph of a graph such that it covers all the vertices..

b) Contains (n-1) edges given n vertices..

Now consider a subgraph of n' vertices where n' < n such that the resulting subgraph is acyclic..Now this is a valid tree but not a spanning tree as it violates a) point..

Hence the given statement is false..

selected by

Related questions

7 votes
7 votes
1 answer
1
vishal chugh asked Jan 18, 2018
2,134 views
The number of distinct minimum spanning trees for the weighted graph shown below is ___________.
0 votes
0 votes
2 answers
2
Nidhi Budhraja asked Aug 31, 2018
734 views
Q1) Why is the path between a pair of vertices in a minimum Spanning tree of an undirected graph not the shortest( minimum weight) path?
1 votes
1 votes
1 answer
3
Ram Swaroop asked Jan 30, 2019
1,561 views
Consider a simple undirected weighted graph G(V, E) with 10 vertices and 45 edge, assume (u, v) are two vertices weight of a edge is =4lu- vl then the minimum cost of the...
3 votes
3 votes
0 answers
4
smsubham asked Jan 6, 2018
519 views
Am getting 7. The answer given is 10.A - B , A - D , D - E , E - C are the edges i have included.