Iterative construction of the minimum independent dominating sets in hypercube graphs

DOI10.1007/S43069-022-00186-0MaRDI QIDQ2677356zbMATH OpenOpenAlexFDO

Authors Debabani Chowdhury

Publication date 13 January 2023

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s43069-022-00186-0

zbMATH Keywords

Cayley graphsefficient dominating sethypercube graphsindependent domination

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-reduce algorithm for finding a minimum independent dominating set
• Dominating Cartesian products of cycles
• Algorithms to determine an independent dominating set of \(\mathrm{ESC}(n,k)\)
• Independent domination in hypercubes
• A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs

Cites work

• A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Independent domination in finitely defined classes of graphs: polynomial algorithms
• Independent domination in hypercubes
• Independent perfect domination sets in Cayley graphs
• On approximating the minimum independent dominating set
• On independent and \((d, n)\)-domination numbers of hypercubes

Cited in

(1)

• Optimizing message dissemination in social networks through fuzzy regular equitable fair domination

This page was built for publication: Iterative construction of the minimum independent dominating sets in hypercube graphs

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