Recursive circulants and their embeddings among hypercubes
From MaRDI portal
Publication:1575703
DOI10.1016/S0304-3975(00)00176-6zbMath0945.68003MaRDI QIDQ1575703
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
embedding; diameter; connectivity; Hamiltonian property; routing algorithm; circulant graph; multicomputer network; interconnection structure
68M10: Network design and communication in computer systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding trees in recursive circulants
- On Group Graphs and Their Fault Tolerance
- Generalized de Bruijn digraphs
- Minimal broadcast networks
- Efficient Embeddings of Trees in Hypercubes
- The twisted N-cube with application to multiprocessing
- Optimal numberings and isoperimetric problems on graphs
- Optimal Assignments of Numbers to Vertices
- A general class of invulnerable graphs