in Graph Theory
159 views
0 votes
0 votes
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
in Graph Theory
159 views

Please log in or register to answer this question.