Hypergraph domination and strong independence

DOI10.2298/AADM0902347JMaRDI QIDQ3655056zbMATH OpenFDO

Authors Bibin K. Jose, Zsolt Tuza

Publication date 12 January 2010

Published in Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/AADM0902347J

zbMATH Keywords

balanced hypergraphdisjoint domination numberindependent domination numberinverse domination numberstrongly independent set

Mathematics Subject Classification ID

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

Recommendations

• Some properties of strong domination numbers of hypergraphs.
• scientific article; zbMATH DE number 5917555
• Relations among some parameters of hypergraphs
• A characterization of hypergraphs with large domination number
• Hypergraphs with large domination number and with edge sizes at least three

Cited in

(33)

• Domination in intersecting hypergraphs
• Locating-dominating sets in hypergraphs
• Domination parameters with number 2: interrelations and algorithmic consequences
• Extremal hypergraphs for matching number and domination number
• 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
• Noncover complexes, independence complexes, and domination numbers of hypergraphs
• The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number
• Domination and matching in power and generalized power hypergraphs
• Transversals and independence in linear hypergraphs with maximum degree two
• The minimum number of vertices in uniform hypergraphs with given domination number
• Equality of domination and transversal numbers in hypergraphs
• A characterization of hypergraphs with large domination number
• The disjoint domination game
• The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3
• Domination and total domination in hypergraphs
• On vertex independence number of uniform hypergraphs
• Total transversals and total domination in uniform hypergraphs
• Hypergraphs with large domination number and with edge sizes at least three
• Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
• On domination in edge product hypergraphs
• A note on a problem of Henning and Yeo about the transversal number of uniform linear systems whose 2-packing number is fixed
• A note on domination in intersecting linear system
• Directed domination in oriented hypergraphs
• Total transversals in hypergraphs and their applications
• Some properties of strong domination numbers of hypergraphs.
• scientific article; zbMATH DE number 7687420 (Why is no real title available?)
• Transversals and domination in uniform hypergraphs
• Some combinatorial algorithms on the dominating number of anti-rank k hypergraphs
• On edge product number of hypergraph
• Partial domination of hypergraphs
• Disjoint maximal independent sets in graphs and hypergraphs
• On the \({k}\)-power domination of hypergraphs

This page was built for publication: Hypergraph domination and strong independence

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