The matching interdiction problem in dendrimers

The purpose of the matching interdiction problem in the weighted graph g is to find a subset of vertices r*  v such that the weight of the maximum matching in the graph g[v r* ] is minimized. according to the maximum matching in g , an approximate solution, denoted by r , for this problem is presented. suppose that v(g) is the weight of the maximum matching in g . in this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. we obtain the maximum matching in some types of dendrimers. then, we compute the value of (v(g) - v(g[v r* ])) (v(g) - v(g[v r])) for them. it is shown that this ratio in these classes of dendrimers is equal to the maximum value.