On the path-connectivity, vertex-pancyclicity, and edge-pancyclicity of crossed cubes
From MaRDI portal
Publication:3372053
Recommendations
Cited in
(18)- Survey on path and cycle embedding in some networks
- scientific article; zbMATH DE number 219248 (Why is no real title available?)
- An equivalent definition of the crossed cube
- Geodesic pancyclicity of twisted cubes
- Edge-pancyclicity and Hamiltonian connectivity of twisted cubes
- Geodesic pancyclicity and balanced pancyclicity of augmented cubes
- Optimizing Hamiltonian panconnectedness for the crossed cube architecture
- Complete path embeddings in crossed cubes
- The vertex-pancyclicity of data center networks
- (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
- On the double-vertex-cycle-connectivity of crossed cubes
- On crossing numbers of hypercubes and cube connected cycles
- Edge-pancyclicity of Möbius cubes
- scientific article; zbMATH DE number 5008096 (Why is no real title available?)
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Paths in Möbius cubes and crossed cubes
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Constructing the nearly shortest path in crossed cubes
This page was built for publication: On the path-connectivity, vertex-pancyclicity, and edge-pancyclicity of crossed cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3372053)
