Augmented \(k\)-ary \(n\)-cubes
From MaRDI portal
Publication:621635
DOI10.1016/j.ins.2010.09.005zbMath1211.68014OpenAlexW1969896247MaRDI QIDQ621635
Iain A. Stewart, Yonghong Xiang
Publication date: 28 January 2011
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.09.005
Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)
Related Items (8)
A discrete random walk on the hypercube ⋮ On the automorphism groups of us-Cayley graphs ⋮ The \(t/m\)-diagnosis strategy of augmented \(k\)-ary \(n\)-cubes ⋮ A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees ⋮ The edge connectivity of expanded \(k\)-ary \(n\)-cubes ⋮ The restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubes ⋮ Relationship between extra edge connectivity and component edge connectivity for regular graphs ⋮ Path embeddings with prescribed edge in the balanced hypercube network
Cites Work
- Unnamed Item
- Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks
- On the k-ary hypercube
- A new variation on hypercubes with smaller diameter
- Supercube: An optimally fault tolerant network architecture
- The shuffle-cubes and their generalization
- The Mobius cubes
- Lee distance and topological properties of k-ary n-cubes
- Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
- Augmented cubes
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- The twisted N-cube with application to multiprocessing
- The wide-diameter of then-dimensional toroidal mesh
This page was built for publication: Augmented \(k\)-ary \(n\)-cubes