Spanning subgraphs of a hypercube iii: meshes
- 1 January 1988
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 25 (1), 1-4
- https://doi.org/10.1080/00207168808803655
Abstract
An n-mesh is the cartesian product of n paths. In a binary mesh the order of each of these paths is a power of 2. We show that a mesh spans a hypercube if and only if it is abinary mesh.Keywords
This publication has 3 references indexed in Scilit:
- One‐legged caterpillars span hypercubesJournal of Graph Theory, 1986
- On quasistars in $n$-cubesČasopis pro pěstování matematiky, 1984
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969