We denote the resulting graph by F (q), and we call the cut-inducing set of bonds q the cut set. We say, F (q) is valid if for each connector pair the two vertices fall into different disconnected components. The computation of all valid cut sets can be done by trying out all possible sets of bonds of size c, this results in i=1..c n i cut sets to validate, where c is the maximum number of connector pairs used in the combinatorial library. We call the resulting connected components in F (q) the unlabeled query synthons. Note that there may exist more efficient methods to compute valid cut sets.