A reliability-improving graph transformation with applications to network reliability

DOI10.1002/net.3230220206zbMath0756.90038OpenAlexW2047154829MaRDI QIDQ3989403

A. Satyanarayana, Charles L. Suffel, Laura Schoppmann

Publication date: 28 June 1992

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

reliabilityhighly connected netsprobabilistic flowthreshold net

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On family of graphs with minimum number of spanning trees ⋮ Extremal graphs for the Tutte polynomial ⋮ Eigenvalue monotonicity of \(q\)-Laplacians of trees along a poset ⋮ The average reliability of a graph ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ Graph vulnerability parameters, compression, and threshold graphs ⋮ Graph vulnerability parameters, compression, and quasi-threshold graphs ⋮ Network reliability in Hamiltonian graphs ⋮ On a poset of trees ⋮ Graphs with the maximum or minimum number of 1-factors ⋮ A survey of some network reliability analysis and synthesis results ⋮ Undirected simple connected graphs with minimum number of spanning trees ⋮ 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

• Unnamed Item
• Maximizing the number of spanning trees in a graph with n nodes and m edges