Packing internally disjoint Steiner paths of modified bubble-sort networks
From MaRDI portal
Cites work
- 3-path-connectivity of Cayley graphs generated by transposition trees
- A group-theoretic model for symmetric interconnection networks
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
- Congruent Graphs and the Connectivity of Graphs
- Fault-tolerant strong Menger connectivity of modified bubble-sort graphs
- Graph theory
- On tree-connectivity and path-connectivity of graphs
- Path connectivity of line graphs and total graphs of complete bipartite graphs
- Path-connectivity in graphs
- Pendant tree-connectivity
- Reliability analysis of exchanged hypercubes based on the path connectivity
- Reliability assessment for modified bubble-sort networks
- Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- The 3-path-connectivity of the \(k\)-ary \(n\)-cube
- The 3-path-connectivity of the hypercubes
- The 3-path-connectivity of the star graphs
- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- Two kinds of generalized connectivity of dual cubes
This page was built for publication: Packing internally disjoint Steiner paths of modified bubble-sort networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908098)
