A simple proof of the Gross‐Saccoman multigraph conjecture

DOI10.1002/net.22110zbMath1528.90060OpenAlexW4281705212WikidataQ113913601 ScholiaQ113913601MaRDI QIDQ6064167

Unnamed Author, Pablo Romero, Unnamed Author

Publication date: 12 December 2023

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

multigraphgraph theorynetwork reliabilityuniformly most reliable graphself-similarity propertyGross-Saccoman multigraph conjecture

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Cites Work

• SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS
• On unreliability polynomials and graph connectivity in reliable network synthesis
• On graphs with randomly deleted edges
• A proof of Boesch's conjecture
• Uniformly optimally reliable graphs
• On the existence of uniformly optimally reliable networks

This page was built for publication: A simple proof of the Gross‐Saccoman multigraph conjecture