The extra connectivity of bubble-sort star graphs
From MaRDI portal
Publication:306258
DOI10.1016/J.TCS.2016.06.043zbMATH Open1348.68021OpenAlexW2465967402MaRDI QIDQ306258FDOQ306258
Publication date: 31 August 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.043
Recommendations
- The generalized connectivity of bubble-sort star graphs
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- The connectivity and super connectivity of the bubble-sort graph
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
- The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs
- Structure connectivity and substructure connectivity of bubble-sort star graph networks
- Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs
- Increasing the connectivity of the star graphs
- Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs
- Fault-tolerant maximal local-connectivity on bubble-sort star graphs
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- On the extraconnectivity of graphs
- Generalized measures of fault tolerance in exchanged hypercubes
- 3-extra connectivity of 3-ary \(n\)-cube networks
- Conditional connectivity for \((n,k)\)-arrangement graphs
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- A kind of conditional fault tolerance of \((n, k)\)-star graphs
- On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
- Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
- Conditional diagnosability and strong diagnosability of split-star networks under the PMC model
- Fault-tolerant maximal local-connectivity on bubble-sort star graphs
- On \(g\)-extra connectivity of folded hypercubes
- Conditional diagnosability of bubble-sort star graphs
Cited In (24)
- Reliability analysis of the cactus-based networks
- Component (edge) connectivity of pancake graphs
- The extra connectivity of the enhanced hypercubes
- Structure connectivity and substructure connectivity of wheel networks
- A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model
- The extra connectivity and extra diagnosability of regular interconnection networks
- The Generalized Connectivity of Bubble-Sort Star Graphs
- Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
- \(h\)-extra \(r\)-component connectivity of interconnection networks with application to hypercubes
- Generalized fault-tolerance for enhanced hypercubes
- Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs
- Characterization of component diagnosability of regular networks
- The 2-extra connectivity of wheel networks
- The 3-good-neighbor connectivity of modified bubble-sort graphs
- On \(g\)-extra conditional diagnosability of hierarchical cubic networks
- Relationship between extra edge connectivity and component edge connectivity for regular graphs
- The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
- Structure connectivity and substructure connectivity of bubble-sort star graph networks
- Two kinds of conditional connectivity of hypercubes
- Conditional diagnosability of the \(\mathit{SP}_n\) graphs under the comparison diagnosis model
- Reliability of \((n,k)\)-star network based on \(g\)-extra conditional fault
- Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks
- Extra (component) connectivity and diagnosability of bubble sort networks
This page was built for publication: The extra connectivity of bubble-sort star graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306258)