Edge-fault-tolerant strong Menger edge connectivity on regular graphs
DOI10.1016/j.tcs.2020.09.035zbMath1464.68301OpenAlexW3088276383MaRDI QIDQ2210512
Publication date: 6 November 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.09.035
regular graphsfault-tolerancestrong Menger edge connectivity\((1, 2)\)-matching composition networksmaximal local edge connectivity
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- On the conditional diagnosability of matching composition networks
- On the generalized twisted cube
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- The two-equal-disjoint path cover problem of matching composition network
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
- 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
- Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks
- Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes
- Local-edge-connectivity in digraphs and oriented graphs
- The Mobius cubes
- The locally twisted cubes
- Augmented cubes
- A Graph-Theoretic Approach to a Communications Problem
This page was built for publication: Edge-fault-tolerant strong Menger edge connectivity on regular graphs