Edge fault tolerance of graphs with respect to super edge connectivity
From MaRDI portal
Publication:412367
DOI10.1016/j.dam.2011.10.033zbMath1239.05108OpenAlexW2011798981MaRDI QIDQ412367
Zhao Zhang, Yanmei Hong, Ji Xiang Meng
Publication date: 4 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.033
Related Items (16)
Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ Bounds for the Super Extra Edge Connectivity of Graphs ⋮ Arc fault tolerance of cartesian product digraphs on hyper arc connectivity ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ Vulnerability of super edge-connected networks ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Edge fault tolerance of super edge connectivity for three families of interconnection networks ⋮ The edge connectivity of expanded \(k\)-ary \(n\)-cubes ⋮ 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 ⋮ Reliability analysis of godan graphs ⋮ Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property ⋮ The restricted \(h\)-connectivity of the data center network DCell ⋮ Realizability of fault-tolerant graphs ⋮ Arc fault tolerance of Kautz digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Some remarks on \(\lambda _{p,q}\)-connectedness
- On the 3-restricted edge connectivity of permutation graphs
- On computing a conditional edge-connectivity of a graph
- On connectivity of the cartesian product of two graphs
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- Cuts leaving components of given minimum order
- 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
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- On optimally-\(\lambda^{(3)}\) transitive graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- A group-theoretic model for symmetric interconnection networks
- Super edge connectivity properties of connected edge symmetric graphs
- Super edge- and point-connectivities of the Cartesian product of regular graphs
- On restricted edge-connectivity of graphs.
This page was built for publication: Edge fault tolerance of graphs with respect to super edge connectivity
