Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
DOI10.1142/S0129054119500278zbMath1427.68030OpenAlexW2997606420WikidataQ126591306 ScholiaQ126591306MaRDI QIDQ5207235
Shuming Zhou, Li Qiong Xu, Weihua Yang
Publication date: 19 December 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054119500278
Cayley graphfault-tolerancemaximal local-connectivitystrong Menger connectivitytransposition-generating graphs
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- Fault-tolerant maximal local-connectivity on bubble-sort star graphs
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
- Some conditional vertex connectivities of complete-transposition graphs
- Strong Menger connectivity with conditional faults on the class of hypercube-like networks
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- On strong Menger-connectivity of star graphs
- Conditional connectivity of Cayley graphs generated by transposition trees
- Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
- Edge disjoint paths in hypercubes and folded hypercubes with conditional faults
- A kind of conditional connectivity of Cayley graphs generated by wheel graphs
- Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Strong Menger connectivity with conditional faults of folded hypercubes
- FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
- On the maximal connected component of a hypercube with faulty vertices III
- Hyper hamiltonian laceability of Cayley graphs generated by transpositions
- Algorithmic Aspects of Graph Connectivity
- A group-theoretic model for symmetric interconnection networks
- On the maximal connected component of hypercube with faulty vertices (II)
- On the maximal connected component of hypercube with faulty vertices
- Edge fault tolerance in graphs
This page was built for publication: Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
