The domination number of the graph defined by two levels of the n-cube

DOI10.1016/J.DAM.2019.02.006MaRDI QIDQ2026316zbMATH OpenOpenAlexFDO

Authors Leila Badakhshian, Zsolt Tuza, Gyula O. H. Katona

Publication date 19 May 2021

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

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

zbMATH Keywords

domination numbertransversal designTurán theorem

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Transversal (matching) theory (05D15)

Recommendations

• The domination number of the graph defined by two levels of the \(n\)-cube. II
• On the domination number of a graph defined by containment
• scientific article; zbMATH DE number 90561
• scientific article; zbMATH DE number 2234856
• Sur le nombre domatique du n-cube et une conjecture de Zelinka. (On the domatic number of the n-cube and a conjecture of Zelinka)

Cites work

• scientific article; zbMATH DE number 3821782 (Why is no real title available?)
• scientific article; zbMATH DE number 3487466 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• Maximal flat antichains of minimum weight
• Saturating Sperner families
• The difference between consecutive primes. II

Cited in

(6)

• The domination number of the graph defined by two levels of the \(n\)-cube. II
• On the domination number of a graph defined by containment
• On the domination number of $t$-constrained de Bruijn graphs
• Dominating sets for uniform subset graphs
• Independent domination in the graph defined by two consecutive levels of the \(n\)-cube
• Sizes of flat maximal antichains of subsets

This page was built for publication: The domination number of the graph defined by two levels of the \(n\)-cube

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