IEH graphs. A novel generalization of hypercube graphs

DOI10.1007/BF01178908MaRDI QIDQ1902299zbMATH OpenFDO

Authors 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

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

Recommendations

• Incrementally extensible hypercube networks and their fault tolerance
• An almost regular fault tolerant network with arbitrary number of nodes
• scientific article; zbMATH DE number 2158952
• Arrangement graphs: A class of generalized star graphs
• Supercube: An optimally fault tolerant network architecture

Cites work

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

Cited in

(4)

• scientific article; zbMATH DE number 842893 (Why is no real title available?)
• Embedding cycles in IEH graphs
• An almost regular fault tolerant network with arbitrary number of nodes
• scientific article; zbMATH DE number 2158952 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902299)