Distance regular subgraphs of a cube (Q686314)

The \(n\)-dimensional cube \(Q_ n\) is regarded as a Cayley graph for the group \((Z_ 2)^ n\) generated by the standard basis. For \(n\) odd, a ``revolving door'' is the induced subgraph of \(Q_ n\) whose vertices are as evenly balanced in the number of 0's and 1's as possible. It is shown that distance regular graphs with isometric embeddings in cubes are precisely the cubes, the even cycles, and the ``revolving doors''. It is also shown that a distance regular graph of girth 4 embedded (not necessarily isometrically) in a cube is itself a cube; some bounds are obtained on various parameters.