The <scp>Gross–Saccoman</scp> conjecture is true

DOI10.1002/net.22006zbMath1529.68224OpenAlexW3108053760WikidataQ123119528 ScholiaQ123119528MaRDI QIDQ6087152

Pablo Romero

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

optimizationgraph theorymultigraphsnetwork reliabilityuniformly optimally reliable graphGross-Saccoman conjecture

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Connectivity (05C40)

Cites Work

• 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
• A proof of Boesch's conjecture
• Uniformly optimally reliable graphs
• Nonexistence of optimal graphs for all terminal reliability
• On the existence of uniformly optimally reliable networks

This page was built for publication: The <scp>Gross–Saccoman</scp> conjecture is true