On the domination of hypergraphs by their edges
From MaRDI portal
Publication:1584310
Recommendations
Cites work
- Computational Complexity of Coherent Systems and the Reliability Polynomial
- Domination theory and the crapo β-invariant
- scientific article; zbMATH DE number 4174106 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3591262 (Why is no real title available?)
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- Reliability of consecutive-k-out-of-n:F systems with nonidentical component reliabilities
- Reliability of Systems with Consecutive Minimal Cutsets
- Some Alternate Characterizations of Reliability Domination
Cited in
(17)- A comment to: Two classes of edge domination in graphs
- Locating-dominating sets in hypergraphs
- Domination on hyperbolic graphs
- Symmetry in domination for hypergraphs with choice
- Domination in hypergraphs
- A characterization of hypergraphs with large domination number
- Hyperdomination in groups.
- scientific article; zbMATH DE number 5917555 (Why is no real title available?)
- Domination hypergraphs of certain digraphs
- Weak edge-degree domination in hypergraphs
- scientific article; zbMATH DE number 929717 (Why is no real title available?)
- On domination in edge product hypergraphs
- Domination in hypergraphs. III: The role of level hypergraphs
- Application of superhypergraphs-based domination number in real world
- Relations among some parameters of hypergraphs
- Some combinatorial algorithms on the dominating number of anti-rank k hypergraphs
- Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs
This page was built for publication: On the domination of hypergraphs by their edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584310)