Algorithms to determine an independent dominating set of ESC(n,k)

zbMATH Open1371.05290MaRDI QIDQ5360962FDOQ5360962

Authors: S. Pious Missier, A. Anto Kinsley, Evangeline Prathibha Fernando 

Publication date: 26 September 2017

Full work available at URL: http://www.malayajournal.org/download.php?id=117

Recommendations

• Two algorithms for determining a minimum independent dominating set
• A branch-and-reduce algorithm for finding a minimum independent dominating set
• scientific article; zbMATH DE number 975419
• A note of independent number and domination number of \(Q_{n, k, m}\)-graph
• Independent domination in hypercubes

zbMATH Keywords

graph theorydominating set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (1)

• Iterative construction of the minimum independent dominating sets in hypercube graphs

This page was built for publication: Algorithms to determine an independent dominating set of \(\mathrm{ESC}(n,k)\)

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