engineering recuitment GATE CSE 2023-24 Test Series Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
Consider G(V, E) be a complete undirected graph with 6 edges having a distinct weight from 1, 3, 9, 27, 81, and 243. Which of the following will not be the weight of the minimum spanning tree of G?
1
121
2
13
3
40
4
31