Hypergraphs with large domination number and with edge sizes at least three

DOI10.1016/J.DAM.2012.03.023MaRDI QIDQ444441zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, Christian Löwenstein

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

zbMATH Keywords

dominationhypergraphtransversal

Mathematics Subject Classification ID

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

Recommendations

• A characterization of hypergraphs with large domination number
• Domination and total domination in hypergraphs
• The minimum number of vertices in uniform hypergraphs with given domination number
• Hypergraphs with large transversal number and with edge sizes at least 3
• Transversals and domination in uniform hypergraphs

Cites work

• A new bound on the domination number of graphs with minimum degree two
• Bounds on a generalized domination parameter
• Covering all cliques of a graph
• Dominating sets in triangulations on surfaces
• Domination in graphs of minimum degree at least two and large girth
• Domination in hypergraphs
• Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
• scientific article; zbMATH DE number 5917555 (Why is no real title available?)
• scientific article; zbMATH DE number 861353 (Why is no real title available?)
• Hypergraph domination and strong independence
• Hypergraphs with large transversal number and with edge sizes at least 3
• Small transversals in hypergraphs
• Total domination of graphs and small transversals of hypergraphs
• Transversals and domination in uniform hypergraphs
• Weak edge-degree domination in hypergraphs

Cited in

(22)

• Domination in intersecting 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 spectral radius and domination number in linear uniform hypergraphs
• 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 minimum number of vertices in uniform hypergraphs with given domination number
• Equality of domination and transversal numbers in hypergraphs
• Domination in hypergraphs
• A characterization of hypergraphs with large domination number
• Hyperdomination in groups.
• Completion and decomposition of hypergraphs into dominating sets of graphs
• Domination and total domination in hypergraphs
• Hypergraphs with large transversal number and with edge sizes at least 3
• Hypergraph domination and strong independence
• Total transversals and total domination in uniform hypergraphs
• Total transversals in hypergraphs and their applications
• Some combinatorial algorithms on the dominating number of anti-rank k hypergraphs
• Partial domination of hypergraphs
• A new look at the concept of domination in hypergraphs

This page was built for publication: Hypergraphs with large domination number and with edge sizes at least three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444441)