Millionaire Mode

Computer Science (GATE Exam) 2010 - Previous Question Paper Solution

Question 1 of 64

Let G=(V, E) be a graph. Define $\xi(G) = \sum\limits_d i_d*d$, where $i_d$ is the number of vertices of degree $d$ in G. If S and T are two different trees with $\xi(S) = \xi(T)$, then

  1. $\mid$S$\mid$ = 2$\mid$T$\mid$
  2. $\mid$S$\mid$ = $\mid$T$\mid$ - 1
  3. $\mid$S$\mid$ = $\mid$T$\mid$
  4. $\mid$S$\mid$ = $\mid$T$\mid$ + 1

Prize Money

15₹7 Crores
14₹1 Crore
13₹50,00,000
12₹25,00,000
11₹12,50,000
10₹6,40,000
9₹3,20,000
8₹1,60,000
7₹80,000
6₹40,000
5₹20,000
4₹10,000
3₹5,000
2₹2,000
1₹1,000