Domination of cyclic monotone \((s,t)\)-graphs

DOI10.1007/BF02686251zbMath0965.05077MaRDI QIDQ1581443

A. A. Chernyak

Publication date: 16 October 2000

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

reliabilitydominationmonotone graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Note on complexity of computing the domination of binary systems
• Computational Complexity of Coherent Systems and the Reliability Polynomial
• Calculating bounds on reachability and connectedness in stochastic networks
• Domination theory and the crapo β-invariant
• The Complexity of Enumeration and Reliability Problems
• A theorem concerning cyclic directed graphs with applications to network reliability
• A Unified Formula for Analysis of Some Network Reliability Problems
• A New Algorithm for the Reliability Analysis of Multi-Terminal Networks
• New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
• (K, j)-domination and (K, j)-reliability
• Directed network reliability: Domination and computing coefficients of the success‐marginal expansion
• Network reliability and the factoring theorem

This page was built for publication: Domination of cyclic monotone \((s,t)\)-graphs