engineering recuitment GATE CSE 2023-24 Test Series Engineering Mathematics Graph Theory Spanning Trees
Consider the following Adjacency matrix corresponding to some weight Graph ‘G’
|
Vertex |
1 |
2 |
3 |
4 |
5 |
|
1 |
0 |
5 |
0 |
10 |
2 |
|
2 |
5 |
0 |
4 |
6 |
2 |
|
3 |
0 |
4 |
0 |
1 |
0 |
|
4 |
10 |
6 |
1 |
0 |
7 |
|
5 |
2 |
2 |
0 |
7 |
0 |
The wight of the minimum spanning tree for the graph is ‘G’ is
1
9
2
10
3
8
4
11