Edge fault tolerance of graphs with respect to super edge connectivity
From MaRDI portal
Publication:412367
DOI10.1016/J.DAM.2011.10.033zbMATH Open1239.05108OpenAlexW2011798981MaRDI QIDQ412367FDOQ412367
Zhao Zhang, Yanmei Hong, Jixiang 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
Recommendations
- 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
- Edge fault tolerance of regular graphs on super 3-restricted edge connectivity.
- On super edge-connectivity of product graphs
- Edge fault-tolerance of super restricted edge-connected Cartesian product graphs
Cites Work
- Graph theory
- On connectivity of the cartesian product of two graphs
- Extraconnectivity of graphs with large girth
- On the extraconnectivity of graphs
- A group-theoretic model for symmetric interconnection networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On computing a conditional edge-connectivity of a graph
- Optimally super-edge-connected transitive graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- On a kind of restricted edge connectivity of graphs
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Title not available (Why is that?)
- On the 3-restricted edge connectivity of permutation graphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- On restricted edge-connectivity of graphs.
- Cuts leaving components of given minimum order
- On optimally-\(\lambda^{(3)}\) transitive graphs
- Super edge connectivity properties of connected edge symmetric graphs
- Super edge- and point-connectivities of the Cartesian product of regular graphs
- Title not available (Why is that?)
- Some remarks on \(\lambda _{p,q}\)-connectedness
Cited In (18)
- Vulnerability of super edge-connected networks
- Edge fault tolerance of super edge connectivity for three families of interconnection networks
- Edge fault-tolerance of strongly Menger edge connected graphs
- The edge connectivity of expanded \(k\)-ary \(n\)-cubes
- The restricted \(h\)-connectivity of the data center network DCell
- Realizability of fault-tolerant graphs
- Vulnerability of super extra edge-connected graphs
- Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
- Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Arc fault tolerance of Kautz digraphs
- Bounds for the Super Extra Edge Connectivity of Graphs
- Arc fault tolerance of cartesian product digraphs on hyper arc connectivity
- Conditional connectivity of star graph networks under embedding restriction
- Reliability analysis of godan graphs
- A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks
- Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property
This page was built for publication: Edge fault tolerance of graphs with respect to super edge connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412367)
