Discrete Math Multiple Choice Let V be a vertex in a connect

Discrete Math Multiple Choice:

Let V be a vertex in a connect graph. If V is in every possible spanning tree of the graph then,

A. V has a degree of 2

B V has a degree of 1

C. V has a degree of 3

D. V has a degree of 4

Solution

If V is in every spanning tree of a connected graph then V has degree 1.

hence answer is B.