Distance regular subgraphs of a cube

@article{Weichsel1992DistanceRS,
  title={Distance regular subgraphs of a cube},
  author={Paul M. Weichsel},
  journal={Discrete Mathematics},
  year={1992},
  volume={109},
  pages={297-306}
}
We examine the class of distance regular graphs which can be embedded in a cube. We show that in the case of isometric embedding they are precisely the cubes, the even cyc!es and the ‘revolving doors’ -a ‘revolving door’ is the subgraph of an odd dimensional cube whose vertices are as evenly balanced in the number of l’s and O’s as possible. In the general case we show that if the girth of the graph is 4, then it must be a cube, and we also obtain some bounds on the parameters of the graph. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Distance-preserving subgraphs of hypercubes

D. Z. Djokovic
J. Combin. Theory Ser • 1973

Similar Papers

Loading similar papers…