Optimally Reliable Graphs for Both Vertex and Edge Failures

DOI10.1017/S0963548300000493MaRDI QIDQ4289307zbMATH OpenFDO

Authors

Publication date 28 April 1994

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548300000493

zbMATH Keywords

disconnection probabilityoptimal graphsundirected graphunreliable nodes and links

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Optimally reliable networks
• Optimally reliable graphs for both edge and vertex failures
• scientific article; zbMATH DE number 1008457
• scientific article; zbMATH DE number 3884207

Cites work

• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Graphs with the smallest number of minimum cut sets
• On the construction of optimally reliable graphs
• On the design of reliable networks
• On the existence of uniformly optimally reliable networks
• On the Invulnerability of the Regular Complete k-Partite Graphs
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Synthesis of reliable networks - a survey

Cited in

(16)

• Uniformly optimal graphs in some classes of graphs with node failures
• Sixty years of network reliability
• Accessibility and reliability for connected bipartite graphs
• Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property
• On the construction of optimally reliable graphs
• scientific article; zbMATH DE number 3884207 (Why is no real title available?)
• scientific article; zbMATH DE number 3880759 (Why is no real title available?)
• Optimally reliable graphs for both edge and vertex failures
• scientific article; zbMATH DE number 4102997 (Why is no real title available?)
• scientific article; zbMATH DE number 1008457 (Why is no real title available?)
• Binary strings and reliability of path networks
• scientific article; zbMATH DE number 6945770 (Why is no real title available?)
• scientific article; zbMATH DE number 867686 (Why is no real title available?)
• A nearly optimal oracle for avoiding failed vertices and edges
• Trees with large numbers of subtrees
• On the split reliability of graphs

This page was built for publication: Optimally Reliable Graphs for Both Vertex and Edge Failures

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