Hypergraphs with large domination number and with edge sizes at least three
From MaRDI portal
Publication:444441
DOI10.1016/j.dam.2012.03.023zbMath1245.05098OpenAlexW1976294637MaRDI QIDQ444441
Christian Löwenstein, Michael A. Henning
Publication date: 14 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.023
Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
A characterization of hypergraphs with large domination number ⋮ Domination in intersecting hypergraphs ⋮ The minimum number of vertices in uniform hypergraphs with given domination number ⋮ Total transversals and total domination in uniform hypergraphs ⋮ Extremal hypergraphs for matching number and domination number ⋮ Domination game on uniform hypergraphs ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number ⋮ Infectious power domination of hypergraphs ⋮ Domination and matching in power and generalized power hypergraphs ⋮ The spectral radius and domination number in linear uniform hypergraphs ⋮ Domination and Total Domination in Hypergraphs ⋮ Total Transversals in Hypergraphs and Their Applications
Cites Work
- Unnamed Item
- Unnamed Item
- A new bound on the domination number of graphs with minimum degree two
- Transversals and domination in uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Domination in hypergraphs
- Domination in graphs of minimum degree at least two and large girth
- Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
- Bounds on a generalized domination parameter
- Weak edge-degree domination in hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Hypergraph domination and strong independence
- Dominating sets in triangulations on surfaces
