Edge fault-tolerance of strongly Menger edge connected graphs
From MaRDI portal
Publication:2666578
DOI10.1016/j.disc.2021.112681zbMath1479.05083OpenAlexW3208095416MaRDI QIDQ2666578
Publication date: 23 November 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112681
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing a conditional edge-connectivity of a graph
- On a kind of restricted edge connectivity of graphs
- 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
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- Edge-fault-tolerant strong Menger edge connectivity on regular graphs
- Strongly Menger connectedness of data center network and \((n,k)\)-star graph
- Local-edge-connectivity in digraphs and oriented graphs
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes
- On restricted edge-connectivity of graphs.
This page was built for publication: Edge fault-tolerance of strongly Menger edge connected graphs
