Publication:4865131
From MaRDI portal
zbMath0844.05059MaRDI QIDQ4865131
Michael A. Henning, Stephen T. Hedetniemi, Gerd H. Fricke
Publication date: 22 August 1996
distance; bound; independent domination number; NP-complete; \(n\)-independent set; distance independent domination; \(n\)-independent domination
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs, An algorithm to find two distance domination parameters in a graph, Distance Domination in Graphs