Register

Recent questions tagged minimum-spanning-tree

1 votes
1 answer
1
GATE CSE 2024 | Set 2 | Question: 49
The number of distinct minimum-weight spanning trees of the following graph is
The number of distinct minimum-weight spanning trees of the following graph is
User Avatar
2 votes
2 answers
2
GATE CSE 2024 | Set 1 | Question: 24
The number of spanning trees in a complete graph of $4$ vertices labelled $\text{A, B, C,}$ and $\text{D}$ is _________.
The number of spanning trees in a complete graph of $4$ vertices labelled $\text{A, B, C,}$ and $\text{D}$ is _________.
User Avatar
0 votes
1 answer
4
UGC NET CSE | June 2008 | Part 2 | Question: 2
The complexity of Kruskal's minimum spanning tree algorithm on a graph with ' $n$ ' nodes and ' $e$ ' edges is : $\mathrm{O}(n)$ $\mathrm{O}(n \log n)$ $\mathrm{O}(e \log n)$ $\mathrm{O}(e)$
The complexity of Kruskal's minimum spanning tree algorithm on a graph with ' $n$ ' nodes and ' $e$ ' edges is :$\mathrm{O}(n)$$\mathrm{O}(n \log n)$$\mathrm{O}(e \log n)...
User Avatar
2 votes
2 answers
7
Gate@Zeal Booklet
Can anyone help in solving the question 105 to 109. I don't have answer key I want to confirm my answer ...i will update my answer in the comments.
Can anyone help in solving the question 105 to 109.I don't have answer key I want to confirm my answer ...i will update my answer in the comments.
User Avatar
0 votes
1 answer
8
UGCNET CSE December 2022: 28
Consider the Graph below: How many spanning trees can be found? $10$ $5$ $9$ $8$ (Option $1 [39409]) 1$ (Option $2[39410]) 2$ (Option $3 [39411]) 3$ (Option $4 [39412]) 4$ Answer Given by Candidate : $2$
Consider the Graph below:How many spanning trees can be found?$10$$5$$9$$8$(Option $1 [39409]) 1$(Option $2[39410]) 2$(Option $3 [39411]) 3$(Option $4 [39412]) 4$Answer G...
User Avatar
1 votes
2 answers
10
GO Classes 2023 | IIITH Mock Test 1 | Question: 11
Suppose that a MST of the following edge-weighted graph contains the edges with weights $x, y$, and $z$. What will be the maximum value of $x+y+z?$ $200$ $250$ $300$ $350$
Suppose that a MST of the following edge-weighted graph contains the edges with weights $x, y$, and $z$.What will be the maximum value of $x+y+z?$$200$$250$$300$$350$
User Avatar
0 votes
0 answers
11
self doubt
Determine the number of spanning tree in the following graph ?
Determine the number of spanning tree in the following graph ?
User Avatar
0 votes
0 answers
12
Self Doubt
Determine the number of the spanning treess in the following graph ???
Determine the number of the spanning treess in the following graph ???
User Avatar
0 votes
0 answers
13
Self doubt
Determine the number of the spanning treess in the following graph ???
Determine the number of the spanning treess in the following graph ???
User Avatar
1 votes
1 answer
14
Spanning Tree
Determine the number of the spanning treess in the following graph ???
Determine the number of the spanning treess in the following graph ???
User Avatar
Page: