Edge fault tolerance of graphs with respect to _2-optimal property
From MaRDI portal
Publication:2317864
DOI10.1016/J.TCS.2019.03.024zbMATH Open1428.05175OpenAlexW2924148216MaRDI QIDQ2317864FDOQ2317864
Authors: Yaoyao Zhang, Shuang Zhao, Jixiang Meng 
Publication date: 13 August 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.03.024
Recommendations
- scientific article; zbMATH DE number 6945770
- Edge fault tolerance in graphs
- Edge fault tolerance of graphs with respect to super edge connectivity
- Edge fault-tolerance of strongly Menger edge connected graphs
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- Fault-tolerant edge metric dimension of certain families of graphs
- Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
- Optimally reliable graphs for both edge and vertex failures
- Optimally Reliable Graphs for Both Vertex and Edge Failures
- Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
Cites Work
- Graph theory
- On the extraconnectivity of graphs
- Restricted connectivity for three families of interconnection networks
- Linearly many faults in Cayley graphs generated by transposition trees
- Edge fault tolerance of graphs with respect to super edge connectivity
- On computing a conditional edge-connectivity of a graph
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
- On super and restricted connectivity of some interconnection networks.
- K-restricted edge connectivity for some interconnection networks
- Vulnerability of super edge-connected networks
- Edge fault tolerance of super edge connectivity for three families of interconnection networks
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- On restricted edge-connectivity of graphs.
- Fault tolerant routing in the star and pancake interconnection networks
Cited In (5)
- Edge fault-tolerance of strongly Menger edge connected graphs
- About uniqueness of the minimal 1-edge extension of hypercube Q4
- Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
- Title not available (Why is that?)
- Linearly Many Edge-Faults in 2-Bijective Connection Networks
This page was built for publication: Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317864)
