A reliability-improving graph transformation with applications to network reliability

DOI10.1002/NET.3230220206MaRDI QIDQ3989403zbMATH OpenOpenAlexFDO

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

highly connected netsprobabilistic flowreliabilitythreshold net

Mathematics Subject Classification ID

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

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

(27)

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

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)