🎴 Flashcard Mode
Computer Science (GATE Exam) 2010 - Previous Question Paper Solution
Card1 / 64
Mastered0
Review0
QuestionClick to flip
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
AnswerClick to flip back
A
$\mid$S$\mid$ = $\mid$T$\mid$
💡 Explanation:
By the given condition, S and T are two different trees.
$\xi(S) = \xi(T)$
So, both S and T have the same number of vertices. Thus,
|S| = |T|