Reliabilities of Consecutive-2 Graphs

DOI10.1017/S0269964800000061MaRDI QIDQ3415847zbMATH OpenOpenAlexFDO

Authors Du Ding-Zhu, Frank K. Hwang

Publication date 19 January 2007

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (05C99) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Optimal Assignments for Consecutive-2 Graphs
• Optimal consecutive-2 systems of lines and cycles
• Consecutive-2 systems on trees
• Optimal Consecutive-k−Out−of−n Systems under a Fixed Budget
• Efficient algorithms for computing the reliability of permutation and interval graphs

Cites work

• Fast Recursive Algorithm to Evaluate the Reliability of a Circular Consecutive-k-out-of-n:F System
• Optimal Consecutive-2-Out-of-n Systems
• Simplified Reliabilities for Consecutive-k-out-of-nSystems

Cited in

(10)

• Redundant consecutive-k systems
• Reliabilities for two kinds of graphs with smaller diameters
• Consecutive-2 systems on trees
• Optimal Assignments for Consecutive-2 Graphs
• Optimal consecutive-2 systems of lines and cycles
• scientific article; zbMATH DE number 4065011 (Why is no real title available?)
• A recursive formula for the two‐edge connected and biconnected reliability of a complete graph
• Fractional vertex cover reliability of graphs
• An infinite family of 2-connected graphs that have reliability factorisations
• Faithfulness in chain graphs: the discrete case

This page was built for publication: Reliabilities of Consecutive-2 Graphs

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