Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs

DOI10.1016/0166-218X(92)90134-VzbMath0767.68010MaRDI QIDQ1199425

Arif Ghafoor

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

fault toleranceinterconnection networksfault diagnosissemi-distributed fault-diagnosis scheme

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NP-completeness of some generalizations of the maximum matching problem
• The covering radius of Hadamard codes in odd graphs
• Parallel concepts in graph theory
• Cyclic difference sets
• On Group Graphs and Their Fault Tolerance
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• Graphs as models of communication network vulnerability: Connectivity and persistence
• Codes in Bipartite Distance-Regular Graphs
• A study of odd graphs as fault-tolerant interconnection networks
• Connectivity of transitive graphs
• Optimization of Reduced Dependencies for Synchronous Sequential Machines

This page was built for publication: Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs