Let G=(V, E) be a graph. Define ( ) d
d G =
i - d , where id is the number of vertices of degree d in G. If S and T are two different trees with x (S) = x (T), then
option
(A) S = 2 T
(B) S = T - 1
(C) S = T
(D) S = T + 1