Uniformly optimal digraphs for strongly connected reliability
From MaRDI portal
Recommendations
Cited in
(19)- The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
- Uniformly optimal graphs in some classes of graphs with node failures
- The optimal unicyclic graphs for pair-connected reliability
- Sixty years of network reliability
- Network reliability in Hamiltonian graphs
- Classes of uniformly most reliable graphs for all-terminal reliability
- Some conjectured uniformly optimal reliable networks
- Counterexamples to conjectures for uniformly optimally reliable graphs.
- On the roots of strongly connected reliability polynomials
- Uniformly-most reliable networks do not always exist
- A proof of Boesch's conjecture
- scientific article; zbMATH DE number 2077669 (Why is no real title available?)
- scientific article; zbMATH DE number 6863758 (Why is no real title available?)
- Nonexistence of optimal graphs for all terminal reliability
- The strongly connected reliability of complete digraphs
- scientific article; zbMATH DE number 5031207 (Why is no real title available?)
- Uniformly optimally reliable graphs: A survey
- Network reliability: Heading out on the highway
- Existence of optimally‐greatest digraphs for strongly connected node reliability
This page was built for publication: Uniformly optimal digraphs for strongly connected reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428910)
