Some Alternate Characterizations of Reliability Domination

DOI10.1017/S0269964800001571zbMath1134.90349OpenAlexW2108275048MaRDI QIDQ3415969

Charles L. Suffel, A. Satyanarayana, F. T. Boesch

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/s0269964800001571

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (5)

Chromatic polynomials and network reliability ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey ⋮ A survey of some network reliability analysis and synthesis results ⋮ On the domination of hypergraphs by their edges

Cites Work

• Chromatic polynomials and network reliability
• On an Invariant of Graphs and the Reliability Polynomial
• Domination theory and the crapo β-invariant
• Combinatorial properties of directed graphs useful in computing network reliability
• A logical expansion in mathematics
• Network reliability and the factoring theorem
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Some Alternate Characterizations of Reliability Domination