Latest Gate Aptitude Question SOLUTION: 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

• Placement Papers
• /
• Gate

Gate Question Papers:

(#M40021700) GATE question MATHS Keep an EYE

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

Asked In Gate MAN (11 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) Submit Your Solution