Conditional fault tolerance in a class of Cayley graphs
From MaRDI portal
Publication:2804867
Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Reliability, testing and fault tolerance of networks and computer systems (68M15) Applications of graph theory to circuits and networks (94C15)
Recommendations
- The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
- Conditional matching preclusion sets for an mixed-graph of the star graph and the bubble-sort graph
- Optimally conditional matching preclusion sets for a class of Cayley graphs on the symmetric group
- Conditional matching preclusion number for the Cayley graph on the symmetric group
- Conditional matching preclusion of the modified bubble sort graph
Cites work
- scientific article; zbMATH DE number 3458752 (Why is no real title available?)
- A group-theoretic model for symmetric interconnection networks
- A study of fault tolerance in star graph
- Conditional edge-fault Hamiltonicity of augmented cubes
- Conditional matching preclusion for hypercube-like interconnection networks
- Conditional matching preclusion sets
- Fault tolerance in \(k\)-ary \(n\)-cube networks
- Fault tolerance in bubble-sort graph networks
- Fault tolerance in the arrangement graphs
- Improving bounds on link failure tolerance of the star graph
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Matching preclusion for some interconnection networks
- Robustness of star graph network under link failure
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
Cited in
(13)- Fault-tolerant cube graphs and coding theory
- The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
- \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model
- Degree sequence of configuration model with vertex faults
- Subnetwork preclusion for bubble-sort networks
- The diagnosability of wheel networks with the condition: 2-extra
- The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model
- The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs
- The 2-extra connectivity of wheel networks
- Arc fault tolerance of Kautz digraphs
- The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks
- Subnetwork Preclusion of (n,k)-Star Networks
- Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
This page was built for publication: Conditional fault tolerance in a class of Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804867)