THE GATEBOOK

Normalization Lectures

S1: A tree with n vertices which has no vertices of degree 2 must have at least leaves

S2: The number of trees on 5 labelled vertices is 125.

Which of the following statements is true?

(A). Only S1

(B). Only S2

(C). Only S1 and S2

(D). None of the above

S1: it is true.

S2: According to Cayley's formula for counting spanning trees, for a complete graph Kn, where n is the number of vertices.