recategorized by
5,469 views

2 Answers

Best answer
2 votes
2 votes

The number of different spanning trees in complete graph with n vertices = $n^{(n-2)}$ = here n= 4 so 16

 and for k2,2 4 edges are there so 4 spanning tree are there.

C is answer

selected by
5 votes
5 votes

For any complete graph Kn with n nodes, different spanning trees possible is  n(n-2)

So, for K4, its 4(4-2) = 16

For any Bipartite graph Km,n with m and n nodes, different spanning trees possible is  m(n-1).n(m-1)

So, for K2,2 its  2(2-1).2(2-1) = 2.2 = 4

so answer is C

Answer:

Related questions

7 votes
7 votes
1 answer
1
go_editor asked Aug 14, 2016
5,264 views
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below?2456...
3 votes
3 votes
2 answers
2
go_editor asked Aug 16, 2016
3,701 views
Which of the following is not an inherent application of stack?Implementation of recursionEvaluation of a postfix expressionJob schedulingReverse a string
3 votes
3 votes
3 answers
3
go_editor asked Aug 16, 2016
14,115 views
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be$\frac{n}{2}-1$$\frac{...
4 votes
4 votes
1 answer
4