159 views
Let T be a tree with n vertices and k be the maximum size of an independent set in T. Then the size of maximum matching in T is

(A) k

(B) n−k

(C) (n−1)/2