Combinatorial properties of directed graphs useful in computing network reliability

DOI10.1002/net.3230110405zbMath0468.94016OpenAlexW2032325318WikidataQ126263583 ScholiaQ126263583MaRDI QIDQ3922610

No author found.

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

spanning subgraphinclusion-exclusion expressionprobabilistic directed graph

Mathematics Subject Classification ID

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

Related Items (3)

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

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