IEH graphs. A novel generalization of hypercube graphs

DOI10.1007/BF01178908zbMath0836.68035MaRDI QIDQ1902299

Sumit Sur, Pradip K. Srimani

Publication date: 19 December 1995

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

distributed systemsrouting algorithminterconnection topology

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Embedding cycles in IEH graphs

Cites Work

• Topological properties of supercube
• Supercube: An optimally fault tolerant network architecture
• Cycle prefix digraphs for symmetric interconnection networks
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Dynamically Restructurable Fault-Tolerant Processor Network Architectures
• A Design for Directed Graphs with Minimum Diameter
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: IEH graphs. A novel generalization of hypercube graphs