On the domination of hypergraphs by their edges

DOI10.1016/S0012-365X(97)00244-6zbMath0958.05101MaRDI QIDQ1584310

L. Camarinopoulos, Andreas Behr

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

coveringsigned dominationinterval hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Locating-dominating sets in hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational Complexity of Coherent Systems and the Reliability Polynomial
• Some Alternate Characterizations of Reliability Domination
• Reliability of Systems with Consecutive Minimal Cutsets
• Domination theory and the crapo β-invariant
• Reliability of consecutive-k-out-of-n:F systems with nonidentical component reliabilities
• New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks

This page was built for publication: On the domination of hypergraphs by their edges