Subnetwork reliability of the arrangement graphs under probabilistic fault condition
From MaRDI portal
Publication:6589854
Cites work
- A combinatorial analysis of subcube reliability in hypercubes
- Arrangement graphs: A class of generalized star graphs
- Combinatorial analysis of the subsystem reliability of the split-star network
- Conditional fault tolerance of arrangement graphs
- Conditional matching preclusion for the arrangement graphs
- Fault tolerance in the arrangement graphs
- Fault-tolerant strong Menger (edge) connectivity of arrangement graph
- Graph theory
- scientific article; zbMATH DE number 847313 (Why is no real title available?)
- Multilayer feedforward networks are universal approximators
- Note on reliability evaluation of arrangement graphs
- On the arrangement graph.
- On the reliability of alternating group graph-based networks
- Reliability analysis of subsystem in dual cubes
- Researches for more reliable arrangement graphs in multiprocessor computer system
- Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes
- Subnetwork reliability analysis of bubble-sort graph networks
- Substar reliability analysis in star networks
- The fault‐tolerant beacon set of hexagonal Möbius ladder network
- The indirect k-ary n-cube for a vector processing environment
- The structure fault tolerance of arrangement graphs
Cited in
(2)
This page was built for publication: Subnetwork reliability of the arrangement graphs under probabilistic fault condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589854)
