More reliable graphs are not always stronger

DOI10.1002/net.22141zbMath1529.90035OpenAlexW4313401528MaRDI QIDQ6179694

Christina Graves

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22141

zbMATH Keywords

reliabilitygraph theorynetwork reliabilityspanning subgraphreliability polynomialoptimal graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Cites Work

• Sixty years of network reliability
• Classes of uniformly most reliable graphs for all-terminal reliability
• Uniformly-most reliable networks do not always exist
• On unreliability polynomials and graph connectivity in reliable network synthesis
• On graphs with randomly deleted edges
• A proof of Boesch's conjecture
• Nonexistence of optimal graphs for all terminal reliability
• On the existence of uniformly optimally reliable networks

This page was built for publication: More reliable graphs are not always stronger