recategorized by
444 views
1 votes
1 votes

Please explain the solution 

recategorized by

1 Answer

1 votes
1 votes
You can view this as 4 outer edges and 2 inner edges. Using all 4 outer edges forms a cycle. So can choose:
1) 3 outer edges: So this is $\binom{4}{3}*\binom{2}{1}$ = 8
2) 2 outer edges: You can draw $4$ different graphs with $2$ outer edges and $2$ inner edges.
So, this makes a total of $8+4 = 12$ spanning trees.

Related questions

1 votes
1 votes
1 answer
1
admin asked Dec 15, 2022
324 views
Provide the correct data structures for the following:Asynchronous data transfer and accessing shared resource involve _________.
1 votes
1 votes
0 answers
2
admin asked Dec 15, 2022
506 views
Provide the correct data structures for the following:________ is used for delimiter checking and recursion.
1 votes
1 votes
1 answer
3
admin asked Dec 15, 2022
378 views
Find the number of binary tree(s) with $3$ nodes (i.e., $\text{A, B,}$ and $\text{C})$ which when traversed by pre-order gives the sequence $\textbf{C B A}$. You also nee...
1 votes
1 votes
1 answer
4
admin asked Dec 15, 2022
242 views
If the maximum height of a binary tree is $\mathrm{N},$ then how many number of nodes will there be?