On Relaxation of Dominant
On Relaxation of Dominant Sets
On Relaxation of Dominant Sets
In a graph $G = (V,E)$, a k-ruling set $S$ is one in which all vertices $V$ $S$ are at most $k$ distance from $S$. Finding a minimum k-ruling set is intrinsically linked to the minimum dominating set problem and maximal independent set problem, which have been extensively studied in graph theory. T…
