Least reliable networks and the reliability domination
DOI10.1109/26.61483zbMATH Open0735.90039OpenAlexW2102406336MaRDI QIDQ3971124FDOQ3971124
Authors: F. T. Boesch, A. Satyanarayana, Charles L. Suffel 
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
Recommendations
- A Survey of Network Reliability and Domination Theory
- Publication:5749141
- Bounding the Reliability of Networks
- On the construction of most reliable networks
- Bounds on the Reliability of Networks
- Uniformly-most reliable networks do not always exist
- On the existence of uniformly optimally reliable networks
- The Leggett bounds for network reliability
- Some conjectured uniformly optimal reliable networks
Reliability, availability, maintenance, inspection in operations research (90B25) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15) Graph theory (05C99)
Cited In (16)
- On an Invariant of Graphs and the Reliability Polynomial
- Graph vulnerability parameters, compression, and threshold graphs
- Volume bounds for the phase-locking region in the Kuramoto model
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- Optimal domination polynomials
- Optimal graphs for independence and \(k\)-independence polynomials
- On reliability models associated with the edge domination number for trees
- Undirected simple connected graphs with minimum number of spanning trees
- Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
- Extremal graphs for the Tutte polynomial
- Uniformly optimally reliable graphs: A survey
- A Survey of Network Reliability and Domination Theory
- Non-Stanley bounds for network reliability
- Chromatic polynomials with least coefficients
- Planar graphs with least chromatic coefficients
- Network reliability: Heading out on the highway
This page was built for publication: Least reliable networks and the reliability domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971124)
