Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs
DOI10.1142/S0129054122500137zbMATH Open1517.68309OpenAlexW4281711124MaRDI QIDQ6169952FDOQ6169952
Authors: Zhengqin Yu, Shuming Zhou, Hong Zhang
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054122500137
Recommendations
- DCC linear congruential graphs: a new class of interconnection networks
- Strongly Menger connectedness of data center network and \((n,k)\)-star graph
- Fault-tolerant strong Menger (edge) connectivity of arrangement graph
- Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks
- On strong Menger-connectivity of star graphs
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Fault-tolerant maximal local-connectivity on bubble-sort star graphs
- Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
- Strong Menger connectivity with conditional faults on the class of hypercube-like networks
- On strong Menger-connectivity of star graphs
- Maximally local connectivity and connected components of augmented cubes
- Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
- The \(t/k\)-diagnosability and strong Menger connectivity on star graphs with conditional faults
- DCC linear congruential graphs: a new class of interconnection networks
- Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes
- Strong Menger connectivity with conditional faults of folded hypercubes
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- Edge disjoint paths in hypercubes and folded hypercubes with conditional faults
- Fault-tolerant strong Menger (edge) connectivity of arrangement graph
- The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees
- Edge-disjoint paths in faulty augmented cubes
- Conditional diagnosability of DCCLC graphs under the comparison model
- Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube
Cited In (4)
This page was built for publication: Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169952)