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 Graph Theory graph-matching + – ashutoshsharma asked Sep 21, 2017 ashutoshsharma 466 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes b ks824 answered Feb 21 ks824 comment Share Follow See all 0 reply Please log in or register to add a comment.
