Layout Area of the Hypercube

In this paper we study the square grid area required for laying out H l , the Boolean hypercube of N = 2 vertices. It is shown that this area is ). We describe a layout which occupies this much area and prove that no layout of less area exists