#algorithm
[closed]

in Algorithms closed by
99 views
0 votes
0 votes
closed as a duplicate of: GATE CSE 2024 | Set 1 | Question: 24
how many spanning trees are possible for complete graph of 4 vertices
in Algorithms closed by
99 views

1 Answer

1 vote
1 vote

formula to Calculate for spanning Trees for Kn is  n^n-2  so here n=4 then the Spanning Trees 16 

Related questions

0 votes
0 votes
0 answers
3