<scp>M</scp>ost reliable two‐terminal graphs with node failures

DOI10.1002/net.21968zbMath1527.90086OpenAlexW3046200739MaRDI QIDQ6092632

Unnamed Author, Christina Graves, Tyler Russell, Unnamed Author

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

graph polynomialreliability polynomialtwo-terminal reliabilitynode reliabilitytwo-terminal graphuniformly most reliable

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Unnamed Item
• Uniformly optimal graphs in some classes of graphs with node failures
• Classes of uniformly most reliable graphs for all-terminal reliability
• Uniformly-most reliable networks do not always exist
• On graphs with randomly deleted edges
• On reliability of graphs with node failures
• A proof of Boesch's conjecture
• Nonexistence of optimal graphs for all terminal reliability
• On uniformly most reliable two‐terminal graphs
• Reliable circuits using less reliable relays
• On the existence of uniformly optimally reliable networks

This page was built for publication: <scp>M</scp>ost reliable two‐terminal graphs with node failures