Subnetwork preclusion for bubble-sort networks
From MaRDI portal
Publication:2353651
DOI10.1016/J.IPL.2015.06.011zbMATH Open1331.68025OpenAlexW911343760MaRDI QIDQ2353651FDOQ2353651
Authors: Yuxing Yang, Jing Li, Shiying Wang 
Publication date: 15 July 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.06.011
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- Graph theory
- A group-theoretic model for symmetric interconnection networks
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Title not available (Why is that?)
- Matching preclusion for some interconnection networks
- Hamiltonian laceability of bubble-sort graphs with edge faults
- Robustness of star graph network under link failure
- Improving bounds on link failure tolerance of the star graph
- Fault tolerance in bubble-sort graph networks
- A study of fault tolerance in star graph
- How robust is the n-cube?
- Fault tolerance in \(k\)-ary \(n\)-cube networks
- Fault tolerance in the arrangement graphs
Cited In (7)
- Hyper star fault tolerance of bubble sort networks
- Subnetwork reliability analysis of bubble-sort graph networks
- Subnetwork Preclusion of (n,k)-Star Networks
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
- The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
- Double declined subnetwork reliability analysis in bubble-sort networks under node fault model
- Extra (component) connectivity and diagnosability of bubble sort networks
This page was built for publication: Subnetwork preclusion for bubble-sort networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353651)
