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

DOI10.1002/NET.21968MaRDI QIDQ6092632zbMATH OpenOpenAlexFDO

Authors Christina Graves, Tyler Russell

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 polynomialnode reliabilityreliability polynomialtwo-terminal graphtwo-terminal reliabilityuniformly most reliable

Mathematics Subject Classification ID

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

Recommendations

• Nonexistence of uniformly most reliable two-terminal graphs
• On uniformly most reliable two-terminal graphs
• On the construction of locally most reliable two-terminal graphs
• Uniformly most reliable three-terminal graph of dense graphs
• scientific article; zbMATH DE number 1444280

Cites work

• A proof of Boesch's conjecture
• Classes of uniformly most reliable graphs for all-terminal reliability
• scientific article; zbMATH DE number 1444280 (Why is no real title available?)
• Nonexistence of optimal graphs for all terminal reliability
• On graphs with randomly deleted edges
• On reliability of graphs with node failures
• On the existence of uniformly optimally reliable networks
• On uniformly most reliable two-terminal graphs
• Reliable circuits using less reliable relays
• Uniformly optimal graphs in some classes of graphs with node failures
• Uniformly-most reliable networks do not always exist

Cited in

(3)

• Roots of two‐terminal reliability polynomials
• On the construction of locally most reliable two-terminal graphs
• An optimization-based Monte Carlo method for estimating the two-terminal survival signature of networks with two component classes

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

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