Weak edge-degree domination in hypergraphs
From MaRDI portal
Recommendations
Cites work
- A direct inductive proof of a conjecture due to E. Sampathkumar and L. Pushpa Latha on the weak domination number of a tree
- scientific article; zbMATH DE number 1002178 (Why is no real title available?)
- scientific article; zbMATH DE number 1229622 (Why is no real title available?)
- scientific article; zbMATH DE number 1043862 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
- On hypergraphs without significant cycles
- On the cyclomatic number of a hypergraph
- On weak domination in graphs
- Strong weak domination and domination balance in a graph
- The cyclicity of a hypergraph
Cited in
(8)- On the domination of hypergraphs by their edges
- Symmetry in domination for hypergraphs with choice
- Domination in hypergraphs
- A characterization of hypergraphs with large domination number
- Hypergraphs with large domination number and with edge sizes at least three
- On domination in edge product hypergraphs
- Some properties of strong domination numbers of hypergraphs.
- 2-Point set domination in separable graphs
This page was built for publication: Weak edge-degree domination in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599858)