Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
deep05
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by deep05
10
votes
1
GATE CSE 2010 | Question: 50
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... possible weight of a spanning tree $T$ in this graph such that vertex $0$ is a leaf node in the tree $T$? $7$ $8$ $9$ $10$
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$$$W=\begin{pmatrix} 0...
23.6k
views
answered
Oct 7, 2017
Algorithms
gatecse-2010
algorithms
spanning-tree
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register