Least reliable networks and the reliability domination
From MaRDI portal
Publication:3971124
DOI10.1109/26.61483zbMath0735.90039OpenAlexW2102406336MaRDI QIDQ3971124
F. T. Boesch, Charles L. Suffel, A. Satyanarayana
Publication date: 25 June 1992
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/26.61483
Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25) Graph theory (05C99) Applications of graph theory to circuits and networks (94C15)
Related Items (13)
Non-Stanley bounds for network reliability ⋮ Chromatic polynomials with least coefficients ⋮ Planar graphs with least chromatic coefficients ⋮ Extremal graphs for the Tutte polynomial ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ Volume Bounds for the Phase-Locking Region in the Kuramoto Model ⋮ Graph vulnerability parameters, compression, and threshold graphs ⋮ Optimal domination polynomials ⋮ Graph vulnerability parameters, compression, and quasi-threshold graphs ⋮ Optimal graphs for independence and \(k\)-independence polynomials ⋮ Undirected simple connected graphs with minimum number of spanning trees
This page was built for publication: Least reliable networks and the reliability domination
