Combinatorial properties of directed graphs useful in computing network reliability

DOI10.1002/NET.3230110405MaRDI QIDQ3922610zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1981

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230110405

zbMATH Keywords

inclusion-exclusion expressionprobabilistic directed graphspanning subgraph

Mathematics Subject Classification ID

Theory of software (68N99) Applications of graph theory to circuits and networks (94C15)

Cited in

(3)

• On lattices with Möbius function \(\pm 1,0\)
• Some Alternate Characterizations of Reliability Domination
• Network reliability: Heading out on the highway

This page was built for publication: Combinatorial properties of directed graphs useful in computing network reliability

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