Fault resiliency of Cayley graphs generated by transpositions
From MaRDI portal
Publication:3065613
DOI10.1142/S0129054107005108zbMATH Open1202.68275MaRDI QIDQ3065613FDOQ3065613
Recommendations
- Linearly many faults in Cayley graphs generated by transposition trees
- scientific article; zbMATH DE number 5139492
- The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees
- Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
- Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs
Cites Work
- scientific article; zbMATH DE number 839542 (Why is no real title available?)
- A group-theoretic model for symmetric interconnection networks
- Hyper hamiltonian laceability of Cayley graphs generated by transpositions
- Increasing the connectivity of the star graphs
- Maximal vertex-connectivity of
- Super-connectivity and super-edge-connectivity for some interconnection networks
Cited In (36)
- Reliability analysis of the cactus-based networks
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
- Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
- The conditional fault diagnosability of \((n, k)\)-star graphs
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model
- On the reliability of modified bubble-sort graphs
- Fault diagnosability of arrangement graphs
- The \(Q_{n,k,m}\) graph: a common generalization of various popular interconnection networks
- Super \(R^k\)-vertex-connectedness
- Orienting Cayley graphs generated by transposition trees
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
- Reliability analysis of Cayley graphs generated by transpositions
- A brief account on the development and future research directions of connectivity properties of interconnection networks
- Equal relation between \(g\)-good-neighbor diagnosability under the PMC model and \(g\)-good-neighbor diagnosability under the MM\(^\ast\) model of a graph
- Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern
- The extendability of Cayley graphs generated by transpositions
- A note on generalized matching preclusion in bipartite graphs
- Linearly many faults in Cayley graphs generated by transposition trees
- Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks
- Linearly many faults in arrangement graphs
- On the edge-connectivity of graphs with two orbits of the same size
- Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
- Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs
- The 3-good-neighbor connectivity of modified bubble-sort graphs
- Conditional connectivity of bubble sort graphs
- Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs
- A kind of conditional connectivity of transposition networks generated by \(k\)-trees
- Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions
- Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model
- A note on characterization of the induced matching extendable Cayley graphs generated by transpositions
- Matching preclusion for the (n, k)-bubble-sort graphs
- Linearly many faults in \((n,k)\)-star graphs
- Linearly many faults in 2-tree-generated networks
- Conditional fault diagnosis of hierarchical hypercubes
- Some conditional vertex connectivities of complete-transposition graphs
This page was built for publication: Fault resiliency of Cayley graphs generated by transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065613)
