Reliability of interconnection networks modeled by Cartesian product digraphs
From MaRDI portal
(Redirected from Publication:3548720)
Recommendations
Cites work
- scientific article; zbMATH DE number 4110724 (Why is no real title available?)
- Connectivity and super-connectivity of Cartesian product graphs.
- Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes
- Connectivity of Cartesian product graphs
- Distance and connectivity measures in permutation graphs
- Graphs with Given Group and Given Graph-Theoretical Properties
- On connectivity of the cartesian product of two graphs
- On restricted connectivities of permutation graphs
- Reliability of interconnection networks modeled by a product of graphs
- Theory and Application of Graphs
Cited in
(14)- The restricted edge-connectivity of Kronecker product graphs
- The Menger number of the Cartesian product of graphs
- The reliability of lexicographic product digraphs
- On edge connectivity of direct products of graphs
- Cyclic arc-connectivity in a Cartesian product digraph
- Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
- Arc fault tolerance of Cartesian product digraphs on hyper arc connectivity
- Separation of Cartesian products of graphs into several connected components by the removal of vertices
- Super-connected and super-arc-connected Cartesian product of digraphs
- Connectivity of Cartesian product graphs
- Graph theoretic characterization and reliability of the multiple-clique network
- Reliability of interconnection networks modeled by a product of graphs
- Approximation of functions of large matrices with Kronecker structure
- Network reliability: Heading out on the highway
This page was built for publication: Reliability of interconnection networks modeled by Cartesian product digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548720)
