The (strong) structure connectivity and (strong) substructure connectivity of the ( n , k )-bubble-sort network
From MaRDI portal
Publication:2139791
DOI10.1016/J.AMC.2022.127078OpenAlexW4220669268MaRDI QIDQ2139791FDOQ2139791
Publication date: 19 May 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2022.127078
Discrete mathematics in relation to computer science (68Rxx) Graph theory (05Cxx) Computer system organization (68Mxx)
Cites Work
- Title not available (Why is that?)
- On the extraconnectivity of graphs
- Structure connectivity and substructure connectivity of hypercubes
- Structure connectivity and substructure connectivity of the crossed cube
- Matching preclusion for the (n, k)-bubble-sort graphs
- Structure and substructure connectivity of circulant graphs and hypercubes
- Structure fault tolerance of hypercubes and folded hypercubes
- Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
- Structure connectivity and substructure connectivity of wheel networks
- Vertex-pancyclicity of the \((n,k)\)-bubble-sort networks
- The fault tolerance of \(( n , k )\)-bubble-sort networks
- Path and cycle fault tolerance of bubble-sort graph networks
Cited In (3)
This page was built for publication: The (strong) structure connectivity and (strong) substructure connectivity of the \(( n , k )\)-bubble-sort network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139791)