On an Invariant of Graphs and the Reliability Polynomial

DOI10.1137/0607045MaRDI QIDQ3734148zbMATH OpenOpenAlexFDO

Authors

Publication date 1986

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0607045

zbMATH Keywords

certain reliability measures on an undirected graphcombinatorial invariantfactoring theoremparity of a graphreliability polynomialsigned domination theorem

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 3947973
• Some Alternate Characterizations of Reliability Domination
• scientific article; zbMATH DE number 4095184
• Least reliable networks and the reliability domination
• scientific article; zbMATH DE number 4053686

Cites work

• A Survey of Network Reliability and Domination Theory
• A Unified Formula for Analysis of Some Network Reliability Problems
• Graph theory with applications
• Network reliability and the factoring theorem
• New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks

Cited in

(7)

• Chromatic polynomials and network reliability
• Generalized activities and \(K\)-terminal reliability
• Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula
• Some Alternate Characterizations of Reliability Domination
• scientific article; zbMATH DE number 861352 (Why is no real title available?)
• An infinite family of 2-connected graphs that have reliability factorisations
• Faithfulness in chain graphs: the discrete case

This page was built for publication: On an Invariant of Graphs and the Reliability Polynomial

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