You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in one of the groups: Users, Administrators.


You can view and copy the source of this page.

Return to GATE2010 q1.

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

(A) |S| = 2|T|

(B) |S| = |T| - 1

(C) |S| = |T|

(D) |S| = |T| + 1

Solution by Happy Mittal[edit]

$\xi(G)$ basically is the sum of degrees of all vertices in a graph. If sum of degrees of two different trees are same, then number of nodes in the trees has to be same. We prove this by induction on sum of degree of all vertices in the two trees.

  • Base case : When $\xi(S) = \xi(T) = 1$, then we have only single node in both trees and hence |S| = |T|.
  • Induction hypothesis : Assume, for $\xi(S) = \xi(T) = k$, we have |S| = |T|.
  • Induction step : For $\xi(S) = \xi(T) = k+1$, we must add a leaf vertex in both trees, and hence |S| = |T|.

So |S| = |T|. So option (C) is correct.




blog comments powered by Disqus