Graph theoretic characterization and reliability of the multiple-clique network

DOI10.1016/0895-7177(90)90077-ZzbMath0706.05052OpenAlexW2036312880MaRDI QIDQ919011

Chu-Sing Yang, Wen-Shyong Hsieh, Jih-Shaw Tzeng

Publication date: 1990

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(90)90077-z

zbMATH Keywords

Hamiltonianpoint transitivemessage distancemultiple-clique networkmultiple-clique structuresnode connectivity

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Fault-Tolerant Multiprocessor Link and Bus Network Architectures
• A Regular Fault-Tolerant Architecture for Interconnection Networks
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Graph theoretic reliability analysis for the Boolean n cube networks
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• A Fault-Tolerant Communication Architecture for Distributed Systems
• Reliable circuits using less reliable relays

This page was built for publication: Graph theoretic characterization and reliability of the multiple-clique network