Edge fault tolerance analysis of super \(k\)-restricted connected networks
From MaRDI portal
Publication:963934
DOI10.1016/j.amc.2010.01.060zbMath1220.05067OpenAlexW2074621270MaRDI QIDQ963934
Camino Balbuena, Pedro García-Vázquez
Publication date: 14 April 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.01.060
Related Items
On restricted edge-connectivity of lexicographic product graphs ⋮ On optimizing edge connectivity of product graphs ⋮ \(k\)-restricted edge-connectivity in triangle-free graphs ⋮ Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes ⋮ The conditional fault diagnosability of \((n, k)\)-star graphs ⋮ Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ The reliability of lexicographic product digraphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- K-restricted edge connectivity for some interconnection networks
- Diameter-sufficient conditions for a graph to be super-restricted connected
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- On the 3-restricted edge connectivity of permutation graphs
- On computing a conditional edge-connectivity of a graph
- Extraconnectivity of \(s\)-geodetic digraphs and graphs
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- Extraconnectivity of graphs with large minimum degree and girth
- Super restricted edge-connectivity of vertex-transitive graphs
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- On the extraconnectivity of graphs
- Edge fault tolerance analysis of a class of interconnection networks
- Restricted connectivity for three families of interconnection networks
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Circulants and their connectivities
- Conditional connectivity
- Synthesis of reliable networks - a survey
- Combinatorial analysis of the fault-diameter of the n-cube
