Network transformations and bounding network reliability

DOI10.1002/net.3230230103zbMath0780.90046OpenAlexW2011803132MaRDI QIDQ5285474

John S. Devitt, Charles J. Colbourn, Jason I. Brown

Publication date: 29 June 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230103

zbMATH Keywords

lower and upper boundsall-terminal network reliabilitytransformation on networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (16)

On family of graphs with minimum number of spanning trees ⋮ Non-Stanley bounds for network reliability ⋮ Extremal graphs for the Tutte polynomial ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ Reliability covering problems for hypergraphs ⋮ Graph vulnerability parameters, compression, and threshold graphs ⋮ Graph vulnerability parameters, compression, and quasi-threshold graphs ⋮ Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph ⋮ On a poset of trees ⋮ A novel algorithm on network reliability estimation ⋮ Undirected simple connected graphs with minimum number of spanning trees ⋮ Chip firing and all-terminal network reliability bounds ⋮ Chordal 2‐Connected Graphs and Spanning Trees ⋮ On a conjecture of V. Nikiforov ⋮ Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs

Cites Work

• Minimum partition of a matroid into independent subsets
• Unnamed Item

This page was built for publication: Network transformations and bounding network reliability