Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
From MaRDI portal
Publication:2208247
DOI10.1016/j.jcss.2020.07.002zbMath1464.68035OpenAlexW3044486919MaRDI QIDQ2208247
Weihua Yang, Zongqing Chen, Shuang Zhao, Ji Xiang Meng
Publication date: 23 October 2020
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2020.07.002
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vulnerability of super edge-connected networks
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- Edge fault tolerance of graphs with respect to super edge connectivity
- Fault-tolerant diameter for three family interconnection networks
- Edge fault tolerance of super edge connectivity for three families of interconnection networks
- Fault diameter of Cartesian product graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On computing a conditional edge-connectivity of a graph
- On a kind of restricted edge connectivity of graphs
- Hamiltonian laceability in hypercubes with faulty edges
- Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Optimally super-edge-connected transitive graphs
- Vulnerability of super extra edge-connected graphs
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Super Line-Connectivity Properties of Circulant Graphs
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- A group-theoretic model for symmetric interconnection networks
- Super edge connectivity properties of connected edge symmetric graphs
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Hamiltonian-laceability of star graphs
- Connectivity of transitive graphs
- On restricted edge-connectivity of graphs.
- Longest fault-free paths in star graphs with vertex faults
