Wide diameter for two families of interconnection networks
From MaRDI portal
Recommendations
Cites work
- Congruent Graphs and the Connectivity of Graphs
- Graph theory with applications
- Mengerian properties, hamiltonicity, and claw‐free graphs
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- 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
- Wide diameter of Cartesian graph bundles
- Wide diameters of Cartesian product graphs and digraphs
- Wide-diameter of product graphs
Cited in
(15)- Generalized diameters and Rabin numbers of networks
- Fault-tolerant routing in circulant networks and cycle prefix networks
- Wide diameters of Cartesian product graphs and digraphs
- Wide diameter of generalized Petersen graphs
- scientific article; zbMATH DE number 2185732 (Why is no real title available?)
- Wide diameter and diameter of networks.
- Wide diameter for matching composition networks
- Disjoint paths and k-wide diameter of circulants with degree 4
- On the fault-tolerant diameter and wide diameter of ?-connected graphs
- scientific article; zbMATH DE number 2114049 (Why is no real title available?)
- Some diameter notions in lexicographic product
- The wide-diameter of \(Z_{n, k}\)
- The wide-diameter of regular graphs
- -wide diameters of enhanced pyramid networks
- On spanning wide diameter of spider web networks
This page was built for publication: Wide diameter for two families of interconnection networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993810)
