On Relaxation of Dominant Sets

Max Koster

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 m…