Realizability of fault-tolerant graphs
From MaRDI portal
Publication:262985
DOI10.1007/s40840-015-0130-4zbMath1332.05081OpenAlexW1979484002MaRDI QIDQ262985
Publication date: 4 April 2016
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-015-0130-4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge fault tolerance of graphs with respect to super edge connectivity
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
- On connectivity of the cartesian product of two graphs
- The superconnectivity of large digraphs and graphs
- Extraconnectivity of graphs with large girth
- Connectivity of vertex and edge transitive graphs
- On the extraconnectivity of graphs
- Synthesis of reliable networks - a survey
- Graph theoretic reliability analysis for the Boolean n cube networks
This page was built for publication: Realizability of fault-tolerant graphs