Register

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 41

• retagged by
412 views
5 votes
5 votes

Consider the following weighted graph, where the weight of every edge is written on the edge itself.

What is the number of possible minimum spanning trees for the above graph?

• retagged by
User Avatar

1 Answer

1 votes
1 votes
There are three choices to use an edge of weight $2$ that can be used interchangeably and there are two choices of using an edge of weight $3$ that can be used interchangeably. So there are $3 * 2$ $=6$ possible MST's.
• edited by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

588
views
1 answers
5 votes
GO Classes asked Jan 28
588 views
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 49
We want to use semaphores to implement a shared critical section (CS) among three threads $\mathrm{T} 1$, $\mathrm{T} 2$, and $\mathrm{T} 3$.We want to enforce the execut...
User Avatar
520
views
1 answers
7 votes
GO Classes asked Jan 28
520 views
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 56
For a string $x=x_1 \cdots x_n \in \Sigma^*$, where $\Sigma$ is any alphabet and $x_1, \ldots, x_n \in \Sigma$, we write $x^{\uparrow m}=x^m$ (that is, the usual power of...
User Avatar
681
views
1 answers
8 votes
GO Classes asked Jan 28
681 views
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 57
Consider a pushdown automaton (PDA) with two control states $Q=\{q 1, q 2\}$, start state $q 1$, input alphabet $\Sigma=\{a, b\}$, stack alphabet $\Gamma=\{\perp, a\}$ (w...
User Avatar
Link Copied!