Are there known results of the form that given a hypercube graph $G= (V,E)$ and a positive integer $m$, list all subsets $A \subset V $ with minimum cardinality such that the edge boundary $\delta(A)$ is of cardinality $m$ ($ \delta(A) = \{v | v \notin A, \exists u \in A, (u,v)\in E\} $ ) ?
I understand this will be the edge iso-perimetric problem for the dual graph of the hypercube graph G. But i could not find any explicit answers for the same. Any reference or thoughts would be appreciated.
Thanks.
