The reliability of lexicographic product digraphs
From MaRDI portal
Publication:2279382
Recommendations
- Reliability of interconnection networks modeled by Cartesian product digraphs
- \(\lambda ^{\prime}\)-optimal digraphs
- Arc fault tolerance of Cartesian product digraphs on hyper arc connectivity
- On restricted edge-connectivity of lexicographic product graphs
- Connectivity of lexicographic product and direct product of graphs.
Cites work
- An extremal problem on graphic sequences with a realization containing every \(\ell \)-tree on \(k\) vertices
- Conditional matching preclusion sets
- Connectivity of lexicographic product and direct product of graphs.
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Fault tolerance of locally twisted cubes
- Graph theory with applications
- Stochastic stabilization problem of complex networks without strong connectedness
- Sufficient conditions for hypergraphs to be maximally edge-connected
- Synthesis of reliable networks - a survey
- The \(g\)-extra connectivity and diagnosability of crossed cubes
Cited in
(3)
This page was built for publication: The reliability of lexicographic product digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279382)