Improved Upper Bound on Independent Domination Number for Hypercubes

arXiv2205.06671MaRDI QIDQ6399096FDOQ6399096

Authors: Debabani Chowdhury, Debesh K. Das, Bhargab B. Bhattacharya 

Publication date: 13 May 2022

Abstract: We revisit the problem of determining the independent domination number in hypercubes for which the known upper bound is still not tight for general dimensions. We present here a constructive method to build an independent dominating set $S_n$ for the $n$-dimensional hypercube $Q_n$, where $n=2p+1$, $p$ being a positive integer $ge1$, provided an independent dominating set $S_p$ for the $p$-dimensional hypercube $Q_p$, is known. The procedure also computes the minimum independent dominating set for all $n=2^k-1$, $k>1$. Finally, we establish that the independent domination number $alph{a}_{n}leq3imes{2}^{n-k-2}$ for $7imes{2}^{k-2}-1leqn<2^{k+1}-1$, $k>1$. This is an improved upper bound for this range as compared to earlier work.

Mathematics Subject Classification ID

Combinatorics (05-XX) Order, lattices, ordered algebraic structures (06-XX)

This page was built for publication: Improved Upper Bound on Independent Domination Number for Hypercubes

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