论文信息 - Spanning subgraphs of a hypercube iii: meshes

Spanning subgraphs of a hypercube iii: meshes

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.

Frank Harary | F. Harary | M. Lewinter | Martin Lewinter

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] Ladislav Nebeský,et al. On quasistars in $n$-cubes , 1984 .

[3] Ivan Havel,et al. One-legged caterpillars span hypercubes , 1986, J. Graph Theory.

[4] F. Harary,et al. A survey of the theory of hypercube graphs , 1988 .

[5] Frank Harary,et al. The starlike trees which span a hypercube , 1988 .