Equality of domination and transversal numbers in hypergraphs

DOI10.1016/J.DAM.2013.02.009MaRDI QIDQ2446829zbMATH OpenOpenAlexWikidataFDO

Authors S. Arumugam, Bibin K. Jose, Zsolt Tuza, Csilla Bujtás

Publication date 22 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.02.009

zbMATH Keywords

computational complexitydomination numberhereditary propertyhitting sethypergraphpolynomial hierarchytransversal number

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Transversals and domination in uniform hypergraphs
• A characterization of hypergraphs with large domination number
• Hypergraphs with large domination number and with edge sizes at least three
• Extremal hypergraphs for matching number and domination number
• Domination and matching in power and generalized power hypergraphs

Cites work

• A characterization of graphs with equal domination number and vertex cover number
• Characterization of graphs with equal domination and covering number
• Critical hypergraphs and interesting set-pair systems
• Domination in hypergraphs
• scientific article; zbMATH DE number 5917555 (Why is no real title available?)
• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 3747181 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 736306 (Why is no real title available?)
• scientific article; zbMATH DE number 817208 (Why is no real title available?)
• scientific article; zbMATH DE number 843316 (Why is no real title available?)
• scientific article; zbMATH DE number 878901 (Why is no real title available?)
• Hypergraph domination and strong independence
• On generalized graphs
• On graphs with equal domination and covering numbers
• The complexity of chromatic strength and chromatic edge strength
• Transversals and domination in uniform hypergraphs

Cited in

(21)

• 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
• Bipartite graphs with close domination and \(k\)-domination numbers
• Graphs with equal domination and covering numbers
• Domination and matching in power and generalized power hypergraphs
• Bipartization of graphs
• The minimum number of vertices in uniform hypergraphs with given domination number
• Matching and domination numbers in \(r\)-uniform hypergraphs
• Perfect graphs for domination games
• Calculation of eigenpair derivatives for symmetric quadratic eigenvalue problem with repeated eigenvalues
• Domination and total domination in hypergraphs
• Total transversals and total domination in uniform hypergraphs
• A note on a problem of Henning and Yeo about the transversal number of uniform linear systems whose 2-packing number is fixed
• Eigensensitivity of symmetric damped systems with repeated eigenvalues by generalized inverse
• A note on domination in intersecting linear system
• A Transition from Total Domination in Graphs to Transversals in Hypergraphs
• On the equality of domination number and 2-domination number
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
• On the \({k}\)-power domination of hypergraphs

This page was built for publication: Equality of domination and transversal numbers in hypergraphs

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