Reliability properties of the hypercube network

DOI10.1016/0898-1221(87)90049-6zbMath0643.94045OpenAlexW1969490744MaRDI QIDQ1102261

B. George

Publication date: 1987

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(87)90049-6

zbMATH Keywords

Hamiltonianhypercube networkspoint transitiveaverage message distancereliable networks

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On the properties of arbitrary hypercubes
• Chip-firing and the critical group of a graph
• Parallel concepts in graph theory
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Graph theoretic reliability analysis for the Boolean n cube networks
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• The Indirect Binary n-Cube Microprocessor Array
• Exact calculation of computer network reliability
• Reliable circuits using less reliable relays

This page was built for publication: Reliability properties of the hypercube network