On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem