Fault-diameter of Cartesian graph bundles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- Algorithm for recognizing Cartesian graph bundles
- Asymptotically optimal \((\Delta, D', s)\)-digraphs
- Edge-colorability of graph bundles
- Fault diameter of Cartesian product graphs
- Fault diameter of interconnection networks
- Fault-tolerant routing in circulant networks and cycle prefix networks
- Multiplicative circulant networks. Topological properties and communication algorithms
- On generalized twisted cubes
- On the diameter vulnerability of Kautz digraphs
Cited in
(18)- Plenary Lecture 3: Fault diameters of graph products and bundles
- Mixed fault diameter of Cartesian graph bundles
- The fault-diameter of Cartesian products
- Wide diameter of Cartesian graph bundles
- Graph bundles and Ricci‐flatness
- Mixed fault diameter of Cartesian graph bundles. II.
- Fault diameter of Cartesian product graphs
- Fault diameter of product graphs
- Fault-tolerant diameter for three family interconnection networks
- Edge-fault diameter of \(C_4\)-free graphs
- Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
- Unchanging the diameter of \(k\)-ary \(n\)-cube networks with faulty vertices
- Edge, vertex and mixed fault diameters
- scientific article; zbMATH DE number 5997381 (Why is no real title available?)
- Distance-residual subgraphs
- Connectivity of Cartesian products of graphs
- The edge fault-diameter of Cartesian graph bundles
- On strong graph bundles
This page was built for publication: Fault-diameter of Cartesian graph bundles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845824)