Reliability analysis on the multiple-loop network
From MaRDI portal
Publication:4027826
DOI10.1080/00207729208949458zbMath0765.60090OpenAlexW1969611190MaRDI QIDQ4027826
No author found.
Publication date: 1 April 1993
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207729208949458
reliabilityCayley graphnetwork topologiesreliability for high line failure ratereliability for small line failure rate
Reliability, availability, maintenance, inspection in operations research (90B25) Applications of renewal theory (reliability, demand theory, etc.) (60K10)
Cites Work
- Unnamed Item
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Calculating bounds on reachability and connectedness in stochastic networks
- Graph theoretic reliability analysis for the Boolean n cube networks
- Algebraic Graph Theory
- Congruent Graphs and the Connectivity of Graphs
- Reliable circuits using less reliable relays
This page was built for publication: Reliability analysis on the multiple-loop network