A reliability-improving graph transformation with applications to network reliability

DOI10.1002/NET.3230220206MaRDI QIDQ3989403zbMATHOpenAlexFDO

Authors A. Satyanarayana, Laura Schoppmann, Charles L. Suffel

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

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

Recommendations

• scientific article; zbMATH DE number 1444280
• Some conjectured uniformly optimal reliable networks
• A proof of Boesch's conjecture
• scientific article; zbMATH DE number 139921
• Network transformations and bounding network reliability

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Maximizing the number of spanning trees in a graph with n nodes and m edges

Cited in

(22)

• Network reliability: Heading out on the highway
• Uncoverings on graphs and network reliability
• Reliability-Equivalent-Replacement of a Subnetwork
• Graphs with the maximum or minimum number of 1-factors
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• Extremal graphs for the Tutte polynomial
• Network reliability in Hamiltonian graphs
• Uniformly optimally reliable graphs: A survey
• scientific article; zbMATH DE number 176253 (Why is no real title available?)
• Eigenvalue monotonicity of \(q\)-Laplacians of trees along a poset
• Undirected simple connected graphs with minimum number of spanning trees
• The average reliability of a graph
• Chordal 2-connected graphs and spanning trees
• Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs
• Graph vulnerability parameters, compression, and threshold graphs
• On a conjecture of V. Nikiforov
• On family of graphs with minimum number of spanning trees
• On a poset of trees
• A survey of some network reliability analysis and synthesis results
• scientific article; zbMATH DE number 3939394 (Why is no real title available?)
• Graph vulnerability parameters, compression, and quasi-threshold graphs
• Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern

This page was built for publication: A reliability-improving graph transformation with applications to network reliability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989403)