Sparsest cut

The sparsest cut of a graph is given by $S^{\ast }$ that minimises $\varphi (S^{\ast })$, i.e. $$ \phi(S^*) = \underset{S}{\text{min}} \phi(S)