Link failure tolerance in the arrangement graphs
DOI10.1142/S0129054115500148zbMATH Open1322.68025OpenAlexW2110811367MaRDI QIDQ5261610FDOQ5261610
Kai Feng, Shiying Wang, Guozhen Zhang
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- Arrangement graphs: A class of generalized star graphs
- Conditional fault tolerance of arrangement graphs
- On the arrangement graph.
- Linearly many faults in \((n,k)\)-star graphs
- Conditional matching preclusion for the arrangement graphs
- Robustness of star graph network under link failure
- Improving bounds on link failure tolerance of the star graph
- Fault tolerance in bubble-sort graph networks
- A study of fault tolerance in star graph
- Fault tolerance in the arrangement graphs
Cited In (5)
- 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
- The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
- Structure connectivity and substructure connectivity of bubble-sort star graph networks
This page was built for publication: Link failure tolerance in the arrangement graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261610)
