Iterative Construction of the Minimum Independent Dominating Sets in Hypercube Graphs

Debabani Chowdhury ()
Additional contact information
Debabani Chowdhury: Jadavpur University

SN Operations Research Forum, 2023, vol. 4, issue 1, 1-6

Abstract: Abstract An independent dominating set in a graph is a subset of vertices such that every vertex in a graph is either in the set or adjacent to a vertex in it, and no two vertices in the set are adjacent. An independent dominating set with the smallest cardinality is called the Minimum Independent Dominating Set (MIDS). Finding an MIDS in a graph is an NP-hard problem. In particular, this problem in hypercube graphs of dimension $$2^k-1$$ 2 k - 1 , k being a positive integer $$\ge 1$$ ≥ 1 , coincides with the problem of identifying an efficient dominating set in Cayley graphs. This work proposes a method employing non-recursive technique to solve the problem in hypercube graphs of dimension $$2^k-1$$ 2 k - 1 in exponential time. The work overcomes the limitation in the method given in the earlier paper of this author (Chowdhury, Debabani and Das, Debesh K. and Bhattacharya, Bhargab B. B. (2022) Improved Upper Bound on Independent Domination Number for Hypercubes. arXiv identifier 2205.06671).

Keywords: Hypercube graphs; Independent domination; Efficient dominating set; Cayley graphs (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-022-00186-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:snopef:v:4:y:2023:i:1:d:10.1007_s43069-022-00186-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-022-00186-0

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().