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

DOI10.1016/J.DAM.2019.02.006zbMATH Open1464.05279OpenAlexW2917420686MaRDI QIDQ2026316FDOQ2026316

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

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)

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)

Cites Work

• Title not available (Why is that?)
• The difference between consecutive primes. II
• Title not available (Why is that?)
• Maximal flat antichains of minimum weight
• Saturating Sperner families
• Title not available (Why is that?)

Cited In (5)

• 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
• Independent domination in the graph defined by two consecutive levels of the \(n\)-cube
• Dominating sets for uniform subset graphs
• On the domination number of $t$-constrained de Bruijn graphs

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)