Link failure tolerance in the arrangement graphs
From MaRDI portal
Publication:5261610
Recommendations
Cites work
- A study of fault tolerance in star graph
- Arrangement graphs: A class of generalized star graphs
- Conditional fault tolerance of arrangement graphs
- Conditional matching preclusion for the arrangement graphs
- Fault tolerance in bubble-sort graph networks
- Fault tolerance in the arrangement graphs
- Improving bounds on link failure tolerance of the star graph
- Linearly many faults in \((n,k)\)-star graphs
- On the arrangement graph.
- Robustness of star graph network under link failure
Cited in
(7)- Fault tolerance in the arrangement graphs
- The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
- Robustness of star graph network under link failure
- Structure connectivity and substructure connectivity of bubble-sort star graph networks
- The structure fault tolerance of arrangement graphs
- Structure connectivity and substructure connectivity of wheel networks
- Researches for more reliable arrangement graphs in multiprocessor computer system
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)