Wagner and Petersen are uniformly most-reliable graphs

MaRDI QIDQ6187166zbMATH OpenFDO

Authors Pablo Romero

Publication date 10 January 2024

Full work available at URL http://www.pmu.uy/pmu17/pmu17-0231.pdf

zbMATH Keywords

Petersen graphsWagner graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Uniformly optimally reliable graphs: A survey
• Some conjectured uniformly optimal reliable networks
• Uniformly-most reliable networks do not always exist
• scientific article; zbMATH DE number 1444280
• scientific article; zbMATH DE number 5031207

This page was built for publication: Wagner and Petersen are uniformly most-reliable graphs

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