- Option : C
- Explanation :

Spanning trees in complete graph is equal to n^{(n-2)}(where n is no of sides or regularity in complete graph). So, spanning trees in complete graph K_{4}will be 4^{(4 - 2)}. i.e. 4^{2}= 16. Spanning trees in a bipartite graph K_{m,n}is equal to m^{(n-1)}* n^{(m-1)}. So, spanning trees in K_{2,2}will be 2^{(2-1)}* 2^{(2-1)}. i.e. 2^{1}* 2^{1}.= 4. So, option (C) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : B
- Explanation :

There are BB RR and BR, total outcome is 3, probability that the opposite side is the same color as the one side we observed: It is clear that BB and RR will show the same color on opposite side, so favorable outcome will be 2. Probability will be favorable outcome / total outcome i.e. 2 / 3. So, option (B) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : C
- Explanation :

Total 5 clique will be there. So, option (C) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.