Link Failure Tolerance in the Arrangement Graphs

DOI10.1142/s0129054115500148zbMath1322.68025OpenAlexW2110811367MaRDI QIDQ5261610

Kai Feng, Guozhen Zhang, Shi-ying Wang

Publication date: 6 July 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054115500148

zbMATH Keywords

distributed systemsfault toleranceinterconnection networksarrangement graphslink failure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Structure connectivity and substructure connectivity of wheel networks ⋮ The structure fault tolerance of arrangement graphs ⋮ Researches for more reliable arrangement graphs in multiprocessor computer system ⋮ Structure connectivity and substructure connectivity of bubble-sort star graph networks ⋮ The preclusion numbers and edge preclusion numbers in a class of Cayley graphs

Cites Work

• Conditional matching preclusion for the arrangement graphs
• Fault tolerance in bubble-sort graph networks
• A study of fault tolerance in star graph
• Improving bounds on link failure tolerance of the star graph
• Arrangement graphs: A class of generalized star graphs
• Conditional fault tolerance of arrangement graphs
• Fault tolerance in the arrangement graphs
• Robustness of star graph network under link failure
• On the arrangement graph.
• LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS