On the reliability of modified bubble-sort graphs
From MaRDI portal
Publication:5103950
DOI10.22108/toc.2021.127002.1807OpenAlexW4319447029MaRDI QIDQ5103950
Publication date: 9 September 2022
Full work available at URL: https://doaj.org/article/264e9999144840978ad81d38365f33ce
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Super cyclically edge connected transitive graphs
- Super restricted edge connectivity of regular edge-transitive graphs
- On super restricted edge-connectivity of edge-transitive graphs
- On cyclic edge-connectivity of transitive graphs
- On computing a conditional edge-connectivity of a graph
- Super-connectivity and super-edge-connectivity for some interconnection networks
- Connectivity of vertex and edge transitive graphs
- Some results about the reliability of folded hypercubes
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Super-cyclically edge-connected regular graphs
- Super connectivity of balanced hypercubes
- On optimally-\(\lambda^{(3)}\) transitive graphs
- Edge cuts leaving components of order at least \(m\)
- Symmetric Property and Reliability of Balanced Hypercube
- FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
- Circulants and their connectivities
- On super edge-connectivity of Cartesian product graphs
- Super edge connectivity properties of connected edge symmetric graphs
- Atoms of cyclic edge connectivity in regular graphs
This page was built for publication: On the reliability of modified bubble-sort graphs
