Some Alternate Characterizations of Reliability Domination
From MaRDI portal
Recommendations
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- A logical expansion in mathematics
- Chromatic polynomials and network reliability
- Combinatorial properties of directed graphs useful in computing network reliability
- Domination theory and the crapo β-invariant
- Network reliability and the factoring theorem
- On an Invariant of Graphs and the Reliability Polynomial
Cited in
(12)- Chromatic polynomials and network reliability
- Domination of cyclic monotone \((s,t)\)-graphs
- On the domination of hypergraphs by their edges
- A survey of some network reliability analysis and synthesis results
- Computational Complexity of Coherent Systems and the Reliability Polynomial
- On an Invariant of Graphs and the Reliability Polynomial
- Domination theory and the crapo β-invariant
- Domination reliability
- scientific article; zbMATH DE number 4183154 (Why is no real title available?)
- Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
- Uniformly optimally reliable graphs: A survey
- Oriented matroid systems
This page was built for publication: Some Alternate Characterizations of Reliability Domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415969)