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




Related Items (27)

On locally most reliable three-terminal graphs of sparse graphsHeuristic maximization of the number of spanning trees in regular graphsOptimally Reliable Graphs for Both Vertex and Edge FailuresOn the characterization of graphs with maximum number of spanning treesExtremal graphs for the Tutte polynomialA simple proof of the Gross‐Saccoman multigraph conjectureOn maximum graphs in Tutte polynomial posetsFast reliability ranking of matchstick minimal networksThe average reliability of a graphDr. Charles L. Suffel: Scholar, teacher, mentor, friendUniformly optimally reliable graphs: A surveyNetwork reliability: Heading out on the highwayThe <scp>Gross–Saccoman</scp> conjecture is true<scp>M</scp>ost reliable two‐terminal graphs with node failuresA generalization of Boesch's theoremMore reliable graphs are not always strongerUniformly most reliable three-terminal graph of dense graphsSpanning trees: A surveyOptimal domination polynomialsInvulnerability of planar two-tree networksNetwork reliability in Hamiltonian graphsNonexistence of uniformly most reliable two-terminal graphsOptimal graphs for independence and \(k\)-independence polynomialsA survey of some network reliability analysis and synthesis resultsRandom Accessibility as a Parallelism to Reliability Studies on Simple GraphsClasses of uniformly most reliable graphs for all-terminal reliabilityOn Uniformly Optimal Networks: A Reversal of Fortune?



Cites Work


This page was built for publication: On the existence of uniformly optimally reliable networks