Edge fault tolerance of super edge connectivity for three families of interconnection networks
From MaRDI portal
Publication:454956
DOI10.1016/j.ins.2011.11.006zbMath1263.68030OpenAlexW2043586513MaRDI QIDQ454956
Publication date: 2 October 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2011.11.006
interconnection networkedge connectivityedge fault tolerance of super edge connectivitysuper-\(\lambda \)
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (14)
Strong Menger connectivity with conditional faults of folded hypercubes ⋮ Vulnerability of super edge-connected networks ⋮ The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Edge-fault tolerance of hypercube-like networks ⋮ Hamiltonian properties of honeycomb meshes ⋮ Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity ⋮ Vulnerability of super extra edge-connected graphs ⋮ Conditional connectivity of star graph networks under embedding restriction ⋮ Maximally local connectivity and connected components of augmented cubes ⋮ The Kirchhoff index of hypercubes and related complex networks ⋮ Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property ⋮ Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network ⋮ Arc fault tolerance of Kautz digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Edge fault tolerance of graphs with respect to super edge connectivity
- Super \(p\)-restricted edge connectivity of line graphs
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- On reliability of the folded hypercubes
- Substar reliability analysis in star networks
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- K-restricted edge connectivity for some interconnection networks
- Super-connected and super-arc-connected Cartesian product of digraphs
- Conditional matching preclusion sets
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- On computing a conditional edge-connectivity of a graph
- Extraconnectivity of graphs with large girth
- Results on the edge-connectivity of graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
- Restricted connectivity for three families of interconnection networks
- Sufficient conditions for restricted-edge-connectivity to be optimal
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Sufficient conditions for a graph to be super restricted edge-connected
- On super-edge-connected digraphs and bipartite digraphs
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
This page was built for publication: Edge fault tolerance of super edge connectivity for three families of interconnection networks
