Fault-tolerant diameter for three family interconnection networks
From MaRDI portal
(Redirected from Publication:437063)
Recommendations
Cites work
- Fault diameter of Cartesian product graphs
- Fault diameter of interconnection networks
- Fault diameter of product graphs
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- Fault-diameter of Cartesian graph bundles
- On the diameter vulnerability of Kautz digraphs
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Restricted connectivity for three families of interconnection networks
- Super-connectivity and super-edge-connectivity for some interconnection networks
Cited in
(15)- Topological properties on the diameters of the integer simplex
- scientific article; zbMATH DE number 2185732 (Why is no real title available?)
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- The Component (Edge) Connectivity of Round Matching Composition Networks
- The vulnerability of the diameter of the enhanced hypercubes
- On the fault-tolerant diameter and wide diameter of ?-connected graphs
- Fault tolerance of the star graph interconnection network
- A diagnosis algorithm by using graph-coloring under the PMC model
- Fault diameter of interconnection networks
- Conditional diagnosability of the round matching composition networks
- The diameter vulnerability of the generalized Petersen graph \(GP[tk,k]\)
- scientific article; zbMATH DE number 828049 (Why is no real title available?)
- Large fault-tolerant interconnection networks
- Conditional diagnosability of the \(\mathit{SP}_n\) graphs under the comparison diagnosis model
- On the total\(_k\)-diameter of connection networks
This page was built for publication: Fault-tolerant diameter for three family interconnection networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q437063)
