Domination of cyclic monotone \((s,t)\)-graphs
type: Item
instance of: scholarly article
title: Domination of cyclic monotone \((s,t)\)-graphs
zbMATH Open document ID: 0965.05077
DOI: 10.1007/BF02686251
author: A. A. Chernyak
published in: Mathematical Notes
publication date: 2000-10-16T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1517707
zbMATH Keywords: domination
zbMATH Keywords: reliability
zbMATH Keywords: monotone graph
MaRDI profile type: Publication
cites work: New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
cites work: Domination theory and the crapo β-invariant
cites work: Network reliability and the factoring theorem
cites work: Directed network reliability: Domination and computing coefficients of the success‐marginal expansion
cites work: Computational Complexity of Coherent Systems and the Reliability Polynomial
cites work: (K, j)-domination and (K, j)-reliability
cites work: A Unified Formula for Analysis of Some Network Reliability Problems
cites work: A New Algorithm for the Reliability Analysis of Multi-Terminal Networks
cites work: Q3330352
cites work: Calculating bounds on reachability and connectedness in stochastic networks
cites work: A theorem concerning cyclic directed graphs with applications to network reliability
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Q4198056
cites work: Note on complexity of computing the domination of binary systems
description: scientific article; zbMATH DE number 1517707