Least reliable networks and the reliability domination
From MaRDI portal
Publication:3971124
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
Cited in
(16)- Network reliability: Heading out on the highway
- Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
- Extremal graphs for the Tutte polynomial
- On an Invariant of Graphs and the Reliability Polynomial
- Volume bounds for the phase-locking region in the Kuramoto model
- Chromatic polynomials with least coefficients
- Planar graphs with least chromatic coefficients
- Uniformly optimally reliable graphs: A survey
- Undirected simple connected graphs with minimum number of spanning trees
- Optimal graphs for independence and \(k\)-independence polynomials
- Optimal domination polynomials
- A Survey of Network Reliability and Domination Theory
- Graph vulnerability parameters, compression, and threshold graphs
- Non-Stanley bounds for network reliability
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- On reliability models associated with the edge domination number for trees
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)