SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS

DOI10.1017/S0269964800143074zbMath0996.90011OpenAlexW2042776149MaRDI QIDQ2709780

Milton Sobel, Y. Ath

Publication date: 6 November 2002

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964800143074

zbMATH Keywords

network reliability

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (7)

A simple proof of the Gross‐Saccoman multigraph conjecture ⋮ Fast reliability ranking of matchstick minimal networks ⋮ Uniformly optimally reliable graphs: A survey ⋮ Uniformly most reliable three-terminal graph of dense graphs ⋮ Optimal domination polynomials ⋮ Optimal graphs for independence and \(k\)-independence polynomials ⋮ Classes of uniformly most reliable graphs for all-terminal reliability

This page was built for publication: SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS