Incomplete \(k\)-ary \(n\)-cube and its derivatives.

DOI10.1016/j.jpdc.2003.11.009zbMath1069.68506OpenAlexW2095249536MaRDI QIDQ1427454

Behrooz Parhami, Ding-Ming Kwai

Publication date: 14 March 2004

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2003.11.009

zbMATH Keywords

Cayley graphFault tolerancePruningVLSI layout\(k\)-ary \(n\)-cubeInterconnection networkRouting algorithmFault diameterFixed-degree network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes ⋮ Comparing four classes of torus-based parallel architectures: network parameters and communication performance