Independent domination in the graph defined by two consecutive levels of the \(n\)-cube

DOI10.1016/J.DAM.2024.05.028zbMATH Open1547.05225MaRDI QIDQ6611017

Thomas Kalinowski, Uwe Leck

Publication date: 26 September 2024

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

zbMATH Keywords

independent domination numbersaturating flat antichain

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Saturating Sperner families
• On domination and independent domination numbers of a graph
• Maximal flat antichains of minimum weight
• Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\)
• An upper bound for the Turán number \(t_3(n,4)\)
• Independent domination in graphs: A survey and recent results
• Maximal antichains of minimum size
• The domination number of the graph defined by two levels of the \(n\)-cube
• The domination number of the graph defined by two levels of the \(n\)-cube. II
• An Exact Result for Hypergraphs and Upper Bounds for the Turán Density of $K^r_{r+1}$
• Lower bounds for constant weight codes

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

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