Vulnerability of super edge-connected networks
From MaRDI portal
Publication:391766
DOI10.1016/j.tcs.2013.10.021zbMath1370.05117arXiv1301.4639MaRDI QIDQ391766
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.4639
68M10: Network design and communication in computer systems
05C85: Graph algorithms (graph-theoretic aspects)
94C15: Applications of graph theory to circuits and networks
68M15: Reliability, testing and fault tolerance of networks and computer systems
05C40: Connectivity
Related Items
Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity, Invulnerability of planar two-tree networks, Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity, Vulnerability of super extra edge-connected graphs, Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs, Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property, Arc fault tolerance of Kautz digraphs, Bounds for the Super Extra Edge Connectivity of Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- Edge fault tolerance of graphs with respect to super edge connectivity
- Edge fault tolerance of super edge connectivity for three families of interconnection networks
- On optimizing edge connectivity of product graphs
- K-restricted edge connectivity for some interconnection networks
- Super restricted edge connected Cartesian product graphs
- On the 3-restricted edge connectivity of permutation graphs
- On computing a conditional edge-connectivity of a graph
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
- 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
- On the extraconnectivity of graphs
- Restricted connectivity for three families of interconnection networks
- Edge-fault tolerance of hypercube-like networks
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- On super edge-connectivity of Cartesian product graphs
- Theory and Application of Graphs
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- On restricted edge-connectivity of graphs.
