On an Invariant of Graphs and the Reliability Polynomial

DOI10.1137/0607045zbMath0598.90045OpenAlexW1966981105MaRDI QIDQ3734148

No author found.

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

combinatorial invariantreliability polynomialsigned domination theoremfactoring theoremcertain reliability measures on an undirected graphparity of a graph

Mathematics Subject Classification ID

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

Related Items (3)

Chromatic polynomials and network reliability ⋮ Generalized activities and \(K\)-terminal reliability ⋮ Some Alternate Characterizations of Reliability Domination

Cites Work

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

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