2.4k views

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$
edited | 2.4k views
0

Sum of degrees in a graph $= 2 |E|$, as each edge contributes two to the sum of degrees. So, when sum of degrees are same, number of edges must also be same.

Trees with equal no of edges has to have equal no of vertices as No of Edges $=$ No of vertices $- 1$, in a tree.

So, should be $|S| = |T|$
edited by
+54
Just extra info ->

|S| => Here this notation means no of vertices in Graph. Actually it is not standard notation (Some books do not use it at all ! or even mention it ) , when First time I saw this question, I was clueless, what || meant !

Also ||S|| means no of edges.
0
but it is nowhere mentioned that they are talking about subset of vertices or all the vertices
0
i am still clueless :-) trust me i dint find any logic behind the question , i dint find any reason of |S| and |T| of not being equal and i marked the question and surprisingly my answer is right :-P i know these things shouldnot be done but i took the chance this time and was correct :-D
+3
I came here looking for what those symbol means!

The expression ξ(G) is basically sum of all degrees in a tree.   For example, in the following tree, the sum is 3 + 1 + 1 + 1.

    a
/ | \
b  c  d

Now the questions is, if sum of degrees in trees are same, then what is the relationship between number of vertices present in both trees? The answer is, ξ(G) and ξ(T) is same for two trees, then the trees have same number of vertices. It can be proved by induction. Let it be true for n vertices. If we add a vertex, then the new vertex (if it is not the first node) increases degree by 2, it doesn't matter where we add it. For example, try to add a new vertex say 'e' at different places in above example tee.

+1
by handshaking theorem sum of degrees would be equal  to twice of edges now no of edges in two trees would be same it would equal to n-1 therefore sum of degrees  in both trees would be same here

1
2
3
4
5
6