PREVIOUS YEAR SOLVED PAPERS - JULY 2016 Paper 2
- 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 K4 will be 4(4 - 2). i.e. 42 = 16. Spanning trees in a bipartite graph Km,n is equal to m(n-1) * n(m-1). So, spanning trees in K2,2 will be 2(2-1) * 2(2-1). i.e. 21 * 21.= 4. So, option (C) is correct.
- 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.
Total 5 clique will be there. So, option (C) is correct.