Reliability analysis of exchanged hypercubes based on the path connectivity
From MaRDI portal
Recommendations
Cites work
- 3-path-connectivity of Cayley graphs generated by transposition trees
- A property on edge-disjoint spanning trees
- A strong connectivity property of the generalized exchanged hypercube
- Bounds of the number of disjoint spanning trees
- Congruent graphs and the connectivity of graphs
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Graph theory
- scientific article; zbMATH DE number 6139911 (Why is no real title available?)
- Longest fault-free paths in star graphs with vertex faults
- On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
- On tree-connectivity and path-connectivity of graphs
- Path 3-(edge-)connectivity of lexicographic product graphs
- Path connectivity of line graphs and total graphs of complete bipartite graphs
- Path-connectivity in graphs
- Path-connectivity of lexicographic product graphs
- Pendant tree-connectivity
- Reliability and hybrid diagnosis of exchanged hypercube
- Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube
- The 3-path-connectivity of the \(k\)-ary \(n\)-cube
- The 3-path-connectivity of the hypercubes
- The connectivity of exchanged hypercubes
- The generalized 4-connectivity of exchanged hypercubes
- The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model
Cited in
(3)
This page was built for publication: Reliability analysis of exchanged hypercubes based on the path connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611086)