On uniformly most reliable two‐terminal graphs
From MaRDI portal
Publication:4686674
DOI10.1002/net.21811zbMath1396.90031OpenAlexW2791423714MaRDI QIDQ4686674
Hayley Bertrand, Owen Goff, Christina Graves, Maggie Sun
Publication date: 4 October 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21811
graph polynomialreliability polynomialtwo-terminal reliabilityoptimal networktwo-terminal graphuniformly most reliable
Graph polynomials (05C31) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items
On locally most reliable three-terminal graphs of sparse graphs, Fast reliability ranking of matchstick minimal networks, Uniformly optimally reliable graphs: A survey, Network reliability: Heading out on the highway, <scp>M</scp>ost reliable two‐terminal graphs with node failures, Uniformly most reliable three-terminal graph of dense graphs, Nonexistence of uniformly most reliable two-terminal graphs