A reliability-improving graph transformation with applications to network reliability

DOI10.1002/NET.3230220206zbMATH Open0756.90038OpenAlexW2047154829MaRDI QIDQ3989403FDOQ3989403

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• Maximizing the number of spanning trees in a graph with n nodes and m edges

Cited In (22)

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

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)