The Gateway to Computer Science Excellence
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 Revision by (21 points) | 31 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,384 answers
105,331 users