Domination and matching in power and generalized power hypergraphs

DOI10.1007/S10878-019-00481-3MaRDI QIDQ2292152zbMATH OpenOpenAlexWikidataFDO

Authors Yanxia Dong, Moo Young Sohn, Zuosong Liang

Publication date 3 February 2020

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-019-00481-3

zbMATH Keywords

matchingdominationhypergraphpower hypergraphgeneralized power hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Extremal hypergraphs for matching number and domination number
• Matching and domination numbers in \(r\)-uniform hypergraphs
• Domination in intersecting hypergraphs
• Relations among some parameters of hypergraphs
• Hypergraphs with large domination number and with edge sizes at least three

Cites work

• scientific article; zbMATH DE number 3884213 (Why is no real title available?)
• scientific article; zbMATH DE number 4065037 (Why is no real title available?)
• scientific article; zbMATH DE number 3747181 (Why is no real title available?)
• scientific article; zbMATH DE number 3616474 (Why is no real title available?)
• scientific article; zbMATH DE number 1343519 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• A characterization of graphs with equal domination number and vertex cover number
• A note on a conjecture of Ryser
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Characterization of graphs with equal domination and covering number
• Domination in hypergraphs
• Domination in intersecting hypergraphs
• Equality of domination and transversal numbers in hypergraphs
• Extremal hypergraphs for matching number and domination number
• Hypergraph domination and strong independence
• Hypergraphs with large domination number and with edge sizes at least three
• Hypergraphs with large transversal number and with edge sizes at least 3
• Hypergraphs with large transversal number and with edge sizes at least four
• Linear hypergraphs with large transversal number and maximum degree two
• Matching and domination numbers in \(r\)-uniform hypergraphs
• Matchings and covers in hypergraphs
• On Ryser's conjecture
• Ryser's conjecture for tripartite 3-graphs
• Small transversals in hypergraphs
• Star-uniform graphs
• Total domination in graphs
• Transversal numbers of uniform hypergraphs
• Transversals and domination in uniform hypergraphs
• Transversals and matchings in 3-uniform hypergraphs
• Upper bound for transversals of tripartite hypergraphs

Cited in

(6)

• Domination in intersecting hypergraphs
• The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
• Relations among some parameters of hypergraphs
• An upper bound for the k-power domination number in r-uniform hypergraphs
• Equality of domination and transversal numbers in hypergraphs
• On H-dominating matchings and some number partitions

This page was built for publication: Domination and matching in power and generalized power hypergraphs

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