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

DOI10.1002/NET.22006MaRDI QIDQ6087152zbMATH OpenOpenAlexWikidataFDO

Authors 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

graph theoryGross-Saccoman conjecturemultigraphsnetwork reliabilityoptimizationuniformly optimally reliable graph

Mathematics Subject Classification ID

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

Recommendations

• Uniformly optimally reliable graphs
• A simple proof of the Gross‐Saccoman multigraph conjecture
• Some conjectured uniformly optimal reliable networks
• A proof of Boesch's conjecture
• Uniformly optimally reliable graphs: A survey

Cites work

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

Cited in

(3)

• The \(F^{a,b,c}\) conjecture is true. II.
• The Gotsman-Linial Conjecture is False
• A simple proof of the Gross‐Saccoman multigraph conjecture

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087152)