On the existence of uniformly optimally reliable networks
From MaRDI portal
Publication:5753729
DOI10.1002/net.3230210204zbMath0721.90038OpenAlexW2079375590MaRDI QIDQ5753729
Xiaoming Li, Charles L. Suffel, F. T. Boesch
Publication date: 1991
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230210204
undirected graphnetwork reliabilityequal and independent edge failure probabilitiesperfectly reliable nodes
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (27)
On locally most reliable three-terminal graphs of sparse graphs ⋮ Heuristic maximization of the number of spanning trees in regular graphs ⋮ Optimally Reliable Graphs for Both Vertex and Edge Failures ⋮ On the characterization of graphs with maximum number of spanning trees ⋮ Extremal graphs for the Tutte polynomial ⋮ A simple proof of the Gross‐Saccoman multigraph conjecture ⋮ On maximum graphs in Tutte polynomial posets ⋮ Fast reliability ranking of matchstick minimal networks ⋮ The average reliability of a graph ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ The <scp>Gross–Saccoman</scp> conjecture is true ⋮ <scp>M</scp>ost reliable two‐terminal graphs with node failures ⋮ A generalization of Boesch's theorem ⋮ More reliable graphs are not always stronger ⋮ Uniformly most reliable three-terminal graph of dense graphs ⋮ Spanning trees: A survey ⋮ Optimal domination polynomials ⋮ Invulnerability of planar two-tree networks ⋮ Network reliability in Hamiltonian graphs ⋮ Nonexistence of uniformly most reliable two-terminal graphs ⋮ Optimal graphs for independence and \(k\)-independence polynomials ⋮ A survey of some network reliability analysis and synthesis results ⋮ Random Accessibility as a Parallelism to Reliability Studies on Simple Graphs ⋮ Classes of uniformly most reliable graphs for all-terminal reliability ⋮ On Uniformly Optimal Networks: A Reversal of Fortune?
Cites Work
This page was built for publication: On the existence of uniformly optimally reliable networks